Pages that link to "Item:Q1190520"
From MaRDI portal
The following pages link to Connected domination and Steiner set on weighted permutation graphs (Q1190520):
Displaying 10 items.
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
- On the feedback vertex set problem in permutation graphs (Q1338778) (← links)
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- The balanced connected subgraph problem for geometric intersection graphs (Q2166729) (← links)
- Steiner trees, connected domination and strongly chordal graphs (Q3701460) (← links)
- Optimal Sequential And Parallel Algorithms To Compute A Steiner Tree On Permutation Graphs (Q4454318) (← links)
- Connected domination and steiner set on asteroidal triple-free graphs (Q5060107) (← links)