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

Drawing \(K_{2,n}\): A lower bound

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

DOI10.1016/S0020-0190(02)00433-7zbMath1173.68759OpenAlexW1993859151MaRDI QIDQ1007548

Timothy M. Chan, Alejandro López-Ortiz, Therese C. Biedl

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00433-7


zbMATH Keywords

computational geometrygraph drawingaspect ratioplanar embeddings


Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)


Related Items (1)

A Lower Bound on the Area Requirements of Series-Parallel Graphs




Cites Work

  • An introduction to the geometry of numbers.
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Drawing \(K_{2,n}\): A lower bound

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