A parallel circle-cover minimization algorithm
From MaRDI portal
Publication:1823682
DOI10.1016/0020-0190(89)90031-8zbMATH Open0681.68056OpenAlexW2171581997MaRDI QIDQ1823682FDOQ1823682
Authors: Laurence Boxer, Russ Miller 
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90031-8
Recommendations
- An optimal parallel algorithm for the minimum circle-cover problem
- An optimal parallel circle-cover algorithm
- Parallel circle-cover algorithms
- A parallel algorithm for approximating the minimum cycle cover
- A parallel algorithm for the minimum weighted vertex cover problem
- On a circle-cover minimization problem
- scientific article; zbMATH DE number 4215389
- Optimal parallel algorithms on circular-arc graphs
- A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle
- scientific article; zbMATH DE number 8779
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Cites Work
Cited In (7)
- Parallel circle-cover algorithms
- An optimal parallel algorithm for the minimum circle-cover problem
- An optimal parallel circle-cover algorithm
- On a circle-cover minimization problem
- Finding a minimal cover for binary images: An optimal parallel algorithm
- A parallel algorithm for approximating the minimum cycle cover
- Efficient parallel recognition of some circular arc graphs. I
This page was built for publication: A parallel circle-cover minimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823682)
