Efficient parallel recognition of some circular arc graphs. II
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 140476 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- scientific article; zbMATH DE number 1555976 (Why is no real title available?)
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
- An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
- Bipartite permutation graphs
- Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs
- Efficient parallel algorithms for bipartite permutation graphs
- Efficient parallel recognition of some circular arc graphs. I
- Incidence matrices and interval graphs
- Matrix characterizations of circular-arc graphs
- Minimum Cuts for Circular-Arc Graphs
- On a circle-cover minimization problem
- Optimal parallel time bounds for the maximum clique problem on intervals
- Parallel recognition and decomposition of two terminal series parallel graphs
- Parallel recognition of the consecutive ones property with applications
- The Complexity of Coloring Circular Arcs and Chords
Cited in
(10)- Optimal circular arc representations: Properties, recognition, and construction
- Efficient parallel recognition of some circular arc graphs. I
- A selected tour of the theory of identification matrices
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
- Graph isomorphism and identification matrices: Sequential algorithms
- On the recognition of fuzzy circular interval graphs
- ON THE POWER OF SOME PRAM MODELS
- Circularly compatible ones, \(D\)-circularity, and proper circular-arc bigraphs
- Circular-arc graphs with clique cover number two
- scientific article; zbMATH DE number 140476 (Why is no real title available?)
This page was built for publication: Efficient parallel recognition of some circular arc graphs. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675297)
