Pages that link to "Item:Q1263980"
From MaRDI portal
The following pages link to Optimal parallel algorithms on circular-arc graphs (Q1263980):
Displaying 13 items.
- Optimal algorithms for computing articulation points and some related problems on a circular-arc graph (Q673024) (← links)
- A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle (Q911283) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Distributed algorithm for extrema-finding in circular configuration of processors (Q1083214) (← links)
- Linear time algorithms on circular-arc graphs (Q1183454) (← links)
- \(k\) best cuts for circular-arc graphs (Q1355722) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (Q1767365) (← links)
- A parallel circle-cover minimization algorithm (Q1823682) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- (Q3561694) (← links)
- Distributed algorithms for maximum cliques (Q4338575) (← links)
- Parallel algorithms on circular-arc graphs (Q5917729) (← links)