16 search results - page 1 / 4 » Parameterized Complexity of Vertex Deletion into Perfect Gra... |
FCT
2011
Springer
12 years 4 months ago
2011
Springer
ISAAC
2007
Springer
13 years 11 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
COCOA
2008
Springer
13 years 6 months ago
2008
Springer
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
ENDM
2006
13 years 4 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...