Pages that link to "Item:Q4645186"
From MaRDI portal
The following pages link to Linear time algorithms for dominating pairs in asteroidal triple-free graphs (Q4645186):
Displaying 11 items.
- An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)
- Efficient algorithms for Roman domination on some classes of graphs (Q1003729) (← links)
- On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) (← links)
- Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
- Complexity of paired domination in AT-free and planar graphs (Q2166758) (← links)
- On the minimum eccentricity shortest path problem (Q2404081) (← links)
- On the Minimum Eccentricity Shortest Path Problem (Q3449826) (← links)
- Independent sets in asteroidal triple-free graphs (Q4572004) (← links)
- Computing a dominating pair in an asteroidal triple-free graph in linear time (Q5057448) (← links)
- (Q5071562) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q6487437) (← links)
