Sciweavers

Share
2 search results - page 1 / 1
» Characterizations of restricted pairs of planar graphs allow...
Sort
View
COMGEO
2011
ACM
8 years 2 months ago
Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
J. Joseph Fowler, Michael Jünger, Stephen G. ...
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
9 years 7 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
books