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

Graph Drawing

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

DOI10.1007/b105810zbMath1111.68576DBLPconf/gd/2004OpenAlexW4206160220WikidataQ56267165 ScholiaQ56267165MaRDI QIDQ5711602

David Eppstein

Publication date: 7 December 2005

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

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



Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (4)

When Can Splits be Drawn in the Plane? ⋮ On the edge-length ratio of outerplanar graphs ⋮ Algorithms for media ⋮ Isometric Diamond Subgraphs




This page was built for publication: Graph Drawing

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