Pages that link to "Item:Q1328583"
From MaRDI portal
The following pages link to A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583):
Displaying 8 items.
- Heuristics for automated knowledge source integration and service composition (Q941554) (← links)
- A decomposition strategy for the vertex cover problem (Q1123907) (← links)
- Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
- A heuristic approach to the vertex cover problem (Q3976603) (← links)
- An analysis of heuristics for graph planarization (Q4354090) (← links)
- Approximating the minimum hub cover problem on planar graphs (Q5963689) (← links)