Parallel circle-cover algorithms

DOI10.1016/0020-0190(88)90068-3zbMath0654.68048OpenAlexW1965213248MaRDI QIDQ1108792

Alan A. Bertossi

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90068-3

zbMATH Keywords

SMMparallel algorithmsparallel processingcomputational geometrycircle-cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (7)

Capacitated Arc Stabbing ⋮ An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications ⋮ An optimal parallel algorithm for the minimum circle-cover problem ⋮ Algorithms for interval structures with applications ⋮ Optimal parallel algorithm for shortest-paths problem on interval graphs ⋮ A parallel circle-cover minimization algorithm ⋮ An optimal parallel circle-cover algorithm

Cites Work

• Unnamed Item
• On a circle-cover minimization problem
• An improved parallel algorithm for maximal matching
• An introduction to parallelism in combinatorial optimization
• Some parallel algorithms on interval graphs
• Binary Trees and Parallel Scheduling Algorithms
• Parallel Matrix and Graph Algorithms
• Bounds to Complexities of Networks for Sorting and for Switching

This page was built for publication: Parallel circle-cover algorithms