Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An optimal parallel circle-cover algorithm

From MaRDI portal
Publication:1823694
Jump to:navigation, search

DOI10.1016/0020-0190(89)90060-4zbMath0681.68071OpenAlexW2093810520MaRDI QIDQ1823694

Ivan Stojmenović, Dilip Sarkar

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)90060-4


zbMATH Keywords

combinatorial problemsparallel processingcomputational geometryCREW PRAMcircle-cover


Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (2)

Parallel algorithms for separation of two sets of points and recognition of digital convex polygons ⋮ Efficient parallel recognition of some circular arc graphs. I



Cites Work

  • On a circle-cover minimization problem
  • Parallel circle-cover algorithms
  • An optimal parallel algorithm for solving the maximal elements problem in the plane


This page was built for publication: An optimal parallel circle-cover algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1823694&oldid=14187742"
Category:
  • Pages with script errors
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki