On a circle-cover minimization problem

DOI10.1016/0020-0190(84)90033-4zbMath0534.68049OpenAlexW2013817894MaRDI QIDQ790622

N. E. Zubov

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90033-4

zbMATH Keywords

analysis of algorithmscomputational geometryminimum covercircular- arcs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items (18)

Moldable and castable polygons ⋮ Capacitated Arc Stabbing ⋮ An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications ⋮ Parallel circle-cover algorithms ⋮ On the comparison of bacteriophage populations ⋮ An optimal parallel algorithm for the minimum circle-cover problem ⋮ Algorithms for interval structures with applications ⋮ Distributed computing with the Cloud ⋮ Computational aspects of relaxation complexity: possibilities and limitations ⋮ An optimal algorithm for finding dominating cycles in circular-arc graphs ⋮ Efficient parallel recognition of some circular arc graphs. II ⋮ Incorporating negative-weight vertices in certain vertex-search graph algorithms ⋮ Efficient parallel recognition of some circular arc graphs. I ⋮ Parallel algorithms on circular-arc graphs ⋮ Optimal parallel algorithm for shortest-paths problem on interval graphs ⋮ Computational aspects of relaxation complexity ⋮ A parallel circle-cover minimization algorithm ⋮ An optimal parallel circle-cover algorithm

Cites Work

• Unnamed Item
• Structure theorems for some circular-arc graphs
• An Efficient Test for Circular-Arc Graphs
• Efficient algorithms for interval graphs and circular-arc graphs
• Algorithms on circular-arc graphs
• Coloring a Family of Circular Arcs

This page was built for publication: On a circle-cover minimization problem