836 search results - page 129 / 168 » Orthogonal Colorings of Graphs |
121
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
142
Voted
DM
2000
15 years 1 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
COMBINATORICA
2007
15 years 1 months ago
2007
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
105
click to vote
SG
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We propose a meta user interface to design the user interface to tune vector-valued parameters of a given parametrized model. In our framework, the user defines a desire...
109
click to vote
TOG
2008
15 years 1 months ago
2008
We reduce transmission bandwidth and memory space for images by factoring their repeated content. A transform map and a condensed epitome are created such that all image blocks ca...