Algorithms for clique-independent sets on subclasses of circular-arc graphs
DOI10.1016/J.DAM.2006.03.022zbMATH Open1104.05054OpenAlexW2097999883MaRDI QIDQ2500526FDOQ2500526
Authors: Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme L. Szwarcfiter 
Publication date: 17 August 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.022
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Efficient graph representations
- Linear-time recognition of circular-arc graphs
- Self-clique Helly circular-arc graphs
- Algorithms on circular-arc graphs
- Characterizing circular-arc graphs
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- On balanced graphs
- Stability in circular arc graphs
- Linear time algorithms on circular-arc graphs
- On clique-transversals and clique-independent sets
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithmic Aspects of Neighborhood Numbers
- Fibres and ordered set coloring
- An Efficient Test for Circular-Arc Graphs
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
- Title not available (Why is that?)
Cited In (11)
- Weighted maximum-clique transversal sets of graphs
- On cliques of Helly Circular-arc Graphs
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
- On some graph classes related to perfect graphs: a survey
- Efficient and perfect domination on circular-arc graphs
- Variations of maximum-clique transversal sets on graphs
- Algorithms for finding clique-transversals of graphs
- The clique operator on circular-arc graphs
- Characterizations and recognition of circular-arc graphs and subclasses: a survey
- Clique-perfectness of complements of line graphs
- Clique-perfectness and balancedness of some graph classes
This page was built for publication: Algorithms for clique-independent sets on subclasses of circular-arc graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500526)
