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...
Gespeichert in:
| Veröffentlicht in: | Discrete Mathematics and Theoretical Computer Science Jg. 17 no.2; H. Discrete Algorithms; S. 77 - 100 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Nancy
DMTCS
14.09.2015
Discrete Mathematics & Theoretical Computer Science |
| Schlagworte: | |
| ISSN: | 1365-8050, 1462-7264, 1365-8050 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!