From a Circular-Arc Model to a Proper Circular-Arc Model
From MaRDI portal
Publication:5302066
Recommendations
Cites work
- O(M\cdot N) Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
- A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
- A Simpler Linear-Time Recognition of Circular-Arc Graphs
- Algorithmic graph theory and perfect graphs
- An \(0(n^{1.5})\) algorithm to color proper circular arcs
- An Efficient Test for Circular-Arc Graphs
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
- Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
- Efficient construction of unit circular-arc models
- Efficient graph representations
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- Linear time algorithms on circular-arc graphs
- Linear-time recognition of circular-arc graphs
- Linear-time recognition of Helly circular-arc models and graphs
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- Proper Helly Circular-Arc Graphs
- Stability in circular arc graphs
- Structure theorems for some circular-arc graphs
Cited in
(2)
This page was built for publication: From a Circular-Arc Model to a Proper Circular-Arc Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5302066)