Pages that link to "Item:Q1744983"
From MaRDI portal
The following pages link to Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983):
Displaying 4 items.
- \(\alpha\)-vertex separator is NP-hard even for 3-regular graphs (Q1179551) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Face covers and the genus problem for apex graphs (Q1850536) (← links)
- Covering segments with unit squares (Q5894547) (← links)