Pages that link to "Item:Q790622"
From MaRDI portal
The following pages link to On a circle-cover minimization problem (Q790622):
Displayed 18 items.
- Algorithms for interval structures with applications (Q388095) (← links)
- Efficient parallel recognition of some circular arc graphs. II (Q675297) (← links)
- Parallel circle-cover algorithms (Q1108792) (← links)
- An optimal parallel algorithm for the minimum circle-cover problem (Q1123605) (← links)
- An optimal algorithm for finding dominating cycles in circular-arc graphs (Q1186160) (← links)
- Incorporating negative-weight vertices in certain vertex-search graph algorithms (Q1198080) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- Moldable and castable polygons (Q1334613) (← 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)
- Computational aspects of relaxation complexity (Q2061898) (← links)
- On the comparison of bacteriophage populations (Q2163938) (← links)
- Capacitated Arc Stabbing (Q2376793) (← links)
- Computational aspects of relaxation complexity: possibilities and limitations (Q2689831) (← links)
- Optimal parallel algorithm for shortest-paths problem on interval graphs (Q3366282) (← links)
- Parallel algorithms on circular-arc graphs (Q5917729) (← links)
- Distributed computing with the Cloud (Q6126134) (← links)