206 search results - page 1 / 42 » Extension of a list coloring problem |
APPML
2006
13 years 11 months ago
2006
COCOA
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
TAMC
2010
Springer
14 years 4 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
SPIRE
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
SEFM
2006
IEEE
14 years 4 months ago
2006
IEEE
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...