Pages that link to "Item:Q1123605"
From MaRDI portal
The following pages link to An optimal parallel algorithm for the minimum circle-cover problem (Q1123605):
Displaying 16 items.
- Algorithms for interval structures with applications (Q388095) (← links)
- Testing a simple polygon for monotonicity optimally in parallel (Q688449) (← links)
- On a circle-cover minimization problem (Q790622) (← links)
- Parallel circle-cover algorithms (Q1108792) (← links)
- Finding a minimal cover for binary images: An optimal parallel algorithm (Q1175643) (← links)
- Parallel and serial heuristics for the minimum set cover problem (Q1186830) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- A parallel circle-cover minimization algorithm (Q1823682) (← links)
- An optimal parallel circle-cover algorithm (Q1823694) (← links)
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications (Q1900895) (← links)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
- Capacitated Arc Stabbing (Q2376793) (← links)
- An optimal algorithm for the minimum disc cover problem (Q2471803) (← links)
- Optimal parallel algorithm for shortest-paths problem on interval graphs (Q3366282) (← links)
- OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS (Q4819957) (← links)
- Parallel algorithms on circular-arc graphs (Q5917729) (← links)