60 search results - page 6 / 12 » On embeddability and stresses of graphs |
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
GD
2007
Springer
15 years 5 months ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
96
Voted
WG
2010
Springer
14 years 10 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
GD
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
DCG
2010
14 years 11 months ago
2010
Consider a graph G with n vertices. In this paper we study geometric conditions for an n-tuple of points in Rd to admit a non-zero self stress with underlying graph G. We introduce...