Pages that link to "Item:Q673002"
From MaRDI portal
The following pages link to A linear time algorithm to compute a dominating path in an AT-free graph (Q673002):
Displaying 8 items.
- Treelike comparability graphs (Q1026130) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
- On the minimum eccentricity isometric cycle problem (Q2132344) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem (Q2958315) (← links)
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs (Q4645186) (← links)
- Computing a dominating pair in an asteroidal triple-free graph in linear time (Q5057448) (← links)
