431 search results - page 43 / 87 » Bold Graph Drawings |
115
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
117
Voted
ESA
2000
Springer
15 years 7 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...
116
click to vote
GD
2009
Springer
15 years 8 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...
172
Voted
WAW
2010
Springer
15 years 2 months ago
2010
Springer
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
164
Voted
ER
2005
Springer
15 years 9 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...