90 search results - page 12 / 18 » Obfuscated Drawings of Planar Graphs |
105
click to vote
GD
1998
Springer
15 years 3 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
110
click to vote
ALGORITHMICA
2011
14 years 6 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
102
click to vote
GD
2008
Springer
15 years 23 days ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
105
click to vote
JGAA
2002
14 years 11 months ago
2002
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
122
click to vote
SOFSEM
2007
Springer
15 years 5 months ago
2007
Springer
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...