scientific article; zbMATH DE number 4215389
From MaRDI portal
Publication:3361906
Recommendations
Cited in
(18)- An optimal parallel processor bound in strong orientation of an undirected graph
- Distributed algorithm for extrema-finding in circular configuration of processors
- Linear time algorithms on circular-arc graphs
- Efficient parallel recognition of some circular arc graphs. I
- Optimal parallel algorithms on circular-arc graphs
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
- A parallel circle-cover minimization algorithm
- Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search
- scientific article; zbMATH DE number 5711694 (Why is no real title available?)
- scientific article; zbMATH DE number 140476 (Why is no real title available?)
- Independent Sets in Circular-Arc Graphs
- Parallel algorithms on circular-arc graphs
- Parallel algorithms on circular-arc graphs
- Optimal algorithms for computing articulation points and some related problems on a circular-arc graph
- Efficient parallel recognition of some circular arc graphs. II
- Efficient reduction for path problems on circular-arc graphs
- A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle
- A fast parallel algorithm to recognize partitionable graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3361906)
