Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:14, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity |
scientific article |
Statements
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (English)
0 references
16 November 2017
0 references
vertex cover
0 references
feedback vertex set
0 references
odd cycle transversal
0 references
price of connectivity
0 references
