Efficient parallel recognition of some circular arc graphs. I
From MaRDI portal
(Redirected from Publication:1209733)
Recommendations
- Efficient parallel recognition of some circular arc graphs. II
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
- scientific article; zbMATH DE number 140476
- Optimal circular arc representations: Properties, recognition, and construction
- scientific article; zbMATH DE number 4215389
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 140476 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- A parallel circle-cover minimization algorithm
- Algorithms on circular-arc graphs
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
- An Efficient Test for Circular-Arc Graphs
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
- An optimal parallel algorithm for the minimum circle-cover problem
- An optimal parallel circle-cover algorithm
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Coloring a Family of Circular Arcs
- Dominating sets and domatic number of circular arc graphs
- Efficient algorithms for interval graphs and circular-arc graphs
- Faster optimal parallel prefix sums and list ranking
- Finding Hamiltonian circuits in proper interval graphs
- Finding maximum cliques on circular-arc graphs
- Finding the maximum, merging, and sorting in a parallel computation model
- Incidence matrices and interval graphs
- Matrix characterizations of circular-arc graphs
- Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
- Minimum Cuts for Circular-Arc Graphs
- On a circle-cover minimization problem
- Parallel Merge Sort
- Parallel Prefix Computation
- Parallel recognition and decomposition of two terminal series parallel graphs
- Parallel recognition of the consecutive ones property with applications
- Relations between Concurrent-Write Models of Parallel Computation
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
- Some parallel algorithms on interval graphs
- Stability in circular arc graphs
- Structure theorems for some circular-arc graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The Complexity of Coloring Circular Arcs and Chords
- The NP-completeness column: an ongoing guide
Cited in
(7)- Optimal circular arc representations: Properties, recognition, and construction
- Graph isomorphism and identification matrices: Sequential algorithms
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
- Efficient parallel recognition of some circular arc graphs. II
- Recognizing and representing proper interval graphs in parallel using merging and sorting
- scientific article; zbMATH DE number 140476 (Why is no real title available?)
- A selected tour of the theory of identification matrices
This page was built for publication: Efficient parallel recognition of some circular arc graphs. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209733)
