Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Time-optimal proximity graph computations on enhanced meshes

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

DOI10.1006/JPDC.1997.1421zbMath0909.68095OpenAlexW1964897509MaRDI QIDQ1268803

Stephan Olariu, Ivan Stojmenović, Albert Y. Zomaya

Publication date: 30 March 1999

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/77882da0db190c6be885ac5fda54a7f7ef63c12e


zbMATH Keywords

unimodal polygon


Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Distributed algorithms (68W15)


Related Items (1)

New sequential and parallel algorithms for computing the \(\beta\)-spectrum







This page was built for publication: Time-optimal proximity graph computations on enhanced meshes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1268803&oldid=13368320"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 09:45.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki