Pages that link to "Item:Q1123605"

The following pages link to An optimal parallel algorithm for the minimum circle-cover problem (Q1123605):

Displaying 8 items.

• Algorithms for interval structures with applications (Q388095) (← links)
• Testing a simple polygon for monotonicity optimally in parallel (Q688449) (← links)
• Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications (Q1900895) (← links)
• Capacitated Arc Stabbing (Q2376793) (← 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)