72 search results - page 15 / 15 » Chromatic coloring with a maximum color class |
FOCS
1993
IEEE
13 years 9 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
DAM
2010
13 years 5 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...