Sciweavers

21 search results - page 5 / 5
» dam 2011
Sort
View
DAM
2011
12 years 12 months ago
Untangling planar graphs from a specified vertex position - Hard cases
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...