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