Pages that link to "Item:Q3651563"
From MaRDI portal
The following pages link to An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs (Q3651563):
Displayed 7 items.
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs (Q386432) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- On the 12-representability of induced subgraphs of a grid graph (Q2118234) (← links)
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
