Pages that link to "Item:Q1003667"
From MaRDI portal
The following pages link to A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667):
Displaying 15 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)
- An upper bound on the paired-domination number in terms of the number of edges in the graph (Q710582) (← links)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626) (← links)
- Total domination versus paired-domination in regular graphs (Q1708402) (← links)
- Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← 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)
- A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph (Q2446306) (← links)
- Graphs with maximum size and given paired-domination number (Q2449089) (← links)
- Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← 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)
