436 search results - page 45 / 88 » Lombardi Drawings of Graphs |
138
click to vote
ESA
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
140
click to vote
GD
2009
Springer
15 years 10 months ago
2009
Springer
Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while...
184
click to vote
ER
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
127
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
The efforts put into XML-related technologies have exciting consequences for XML-based graph data formats such as GraphML. We here give a systematic overview of the possibilities ...
143
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...