Improving Vertex Cover as a Graph Parameter
Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In this context, vertex cover is used as a powerful parameter for dealing with graph problems which are hard to solve even when parameterized by tree-width; however, the drawback of vertex cover is that bounding...
Main Author: | Robert Ganian |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2015-09-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2136/pdf |
Similar Items
-
Graphs with many vertex-disjoint cycles
by: Dieter Rautenbach, et al.
Published: (2012-09-01) -
Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-03-01) -
Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-01-01) -
Reducing the rank of a matroid
by: Gwenaël Joret, et al.
Published: (2015-09-01) -
On the complexity of vertex-coloring edge-weightings
by: Andrzej Dudek, et al.
Published: (2011-11-01)