Parallel algorithms on circular-arc graphs
From MaRDI portal
Recommendations
Cites work
- A new approach for the domination problem on permutation 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
- scientific article; zbMATH DE number 3752234 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- Minimum Cuts for Circular-Arc Graphs
- On a circle-cover minimization problem
- Optimal parallel algorithms on circular-arc graphs
Cited in
(10)- Parallel circle-cover algorithms
- An optimal parallel algorithm for the minimum circle-cover problem
- Optimal parallel algorithms on circular-arc graphs
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
- An optimal parallel circle-cover algorithm
- scientific article; zbMATH DE number 4215389 (Why is no real title available?)
- Minimum Cuts for Circular-Arc Graphs
- scientific article; zbMATH DE number 5711694 (Why is no real title available?)
- Parallel algorithms on circular-arc graphs
- Optimal algorithms for computing articulation points and some related problems on a circular-arc graph
This page was built for publication: Parallel algorithms on circular-arc graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5917729)
