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

Algorithms – ESA 2004

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

DOI10.1007/b100428zbMath1111.68600OpenAlexW2483610301MaRDI QIDQ5464638

Mikkel M. Sigurd, Martin Zachariasen

Publication date: 18 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100428



Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (3)

Computing Minimum Dilation Spanning Trees in Geometric Graphs ⋮ Sparse geometric graphs with small dilation ⋮ Graph spanners: a tutorial review







This page was built for publication: Algorithms – ESA 2004

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5464638&oldid=20245747"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 9 February 2024, at 11:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki