Leaf sector covers with applications on circle graphs
DOI10.1016/J.TCS.2024.114619zbMATH Open1539.68232MaRDI QIDQ6549679
Ching-Chi Lin, Po-Yuan Wang, Ta-Yu Mu
Publication date: 4 June 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Data structures (68P05) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total domination and transformation
- Practical and efficient circle graph recognition
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Domination criticality in product graphs
- Improved algorithms and complexity results for power domination in graphs
- Labelling algorithms for paired-domination problems in block and interval graphs
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- A survey of selected recent results on total domination in graphs
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Topics on domination
- The complexity of domination problems in circle graphs
- Paired-domination of trees
- The Hamiltonian circuit problem for circle graphs is NP-complete
- An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs
- Independent domination in graphs: A survey and recent results
- Infectious power domination of hypergraphs
- A linear-time algorithm for paired-domination on circular-arc graphs
- A decomposition approach for solving a broadcast domination network design problem
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- Minimum Fill-in on Circle and Circular-Arc Graphs
- A (2+ε)-Approximation Scheme for Minimum Domination on Circle Graphs
- Paired-domination in graphs
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- A dominating-set-based routing scheme in ad hoc wireless networks
This page was built for publication: Leaf sector covers with applications on circle graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6549679)