Pages that link to "Item:Q1566569"
From MaRDI portal
The following pages link to An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569):
Displaying 19 items.
- Permutation bigraphs and interval containments (Q401140) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- Acyclic domination on bipartite permutation graphs (Q845701) (← links)
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs (Q968185) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266) (← links)
- On the domination number of permutation graphs and an application to strong fixed points (Q2208341) (← links)
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
- Minimum 2-tuple dominating set of permutation graphs (Q2511387) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- Succinct permutation graphs (Q2684486) (← 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)
- Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames (Q5005138) (← links)
- An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774) (← links)
- Domination problems on P<sub>5</sub>-free graphs (Q5248877) (← links)
- Edge-vertex domination on interval graphs (Q6551198) (← links)
