Pages that link to "Item:Q692884"
From MaRDI portal
The following pages link to Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884):
Displaying 9 items.
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) (← links)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← 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)
