43 search results - page 2 / 9 » Polynomial time recognition of unit circular-arc graphs |
JAL
2006
13 years 7 months ago
2006
JAL
2002
13 years 7 months ago
2002
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
FOSSACS
2006
Springer
13 years 11 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...