An optimal algorithm for finding dominating cycles in circular-arc graphs
From MaRDI portal
Publication:1186160
DOI10.1016/0166-218X(92)90201-KzbMath0753.05063MaRDI QIDQ1186160
Publication date: 28 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Bibliography on domination in graphs and some basic definitions of domination parameters, Improved algorithms and complexity results for power domination in graphs, Paths in interval graphs and circular arc graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domination, independent domination, and duality in strongly chordal graphs
- On a circle-cover minimization problem
- Finding minimum dominating cycles in permutation graphs
- Dominating sets and domatic number of circular arc graphs
- Clustering and domination in perfect graphs
- Domination in permutation graphs
- A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
- Minimum dominating cycles in 2-trees
- Minimum dominating cycles in outerplanar graphs
- Dominating Sets in Chordal Graphs