Sciweavers

GD
2005
Springer
14 years 4 months ago
Non-planar Core Reduction of Graphs
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
Carsten Gutwenger, Markus Chimani
GD
2005
Springer
14 years 5 months ago
Incremental Connector Routing
Most diagram editors and graph construction tools provide some form of automatic connector routing, typically providing orthogonal or poly-line connectors. Usually the editor provi...
Michael Wybrow, Kim Marriott, Peter J. Stuckey
GD
2005
Springer
14 years 5 months ago
On Straightening Low-Diameter Unit Trees
Sheung-Hung Poon
GD
2005
Springer
14 years 5 months ago
Odd Crossing Number Is Not Crossing Number
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
GD
2005
Springer
14 years 5 months ago
Applications of Parameterized st-Orientations in Graph Drawing Algorithms
Abstract. Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a d...
Charalampos Papamanthou, Ioannis G. Tollis
GD
2005
Springer
14 years 5 months ago
Drawing Graphs Using Modular Decomposition
Abstract. In this paper we present an algorithm for drawing an undirected graph G which takes advantage of the structure of the modular decomposition tree of G. Specifically, our ...
Charis Papadopoulos, Constantinos Voglis
GD
2005
Springer
14 years 5 months ago
Crossing Number of Toroidal Graphs
János Pach, Géza Tóth
GD
2005
Springer
14 years 5 months ago
A Mixed-Integer Program for Drawing High-Quality Metro Maps
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
Martin Nöllenburg, Alexander Wolff
GD
2005
Springer
14 years 5 months ago
Energy-Based Clustering of Graphs with Nonuniform Degrees
Widely varying node degrees occur in software dependency graphs, hyperlink structures, social networks, and many other real-world graphs. Finding dense subgraphs in such graphs is ...
Andreas Noack
GD
2005
Springer
14 years 5 months ago
On Balloon Drawings of Rooted Trees
Chun-Cheng Lin, Hsu-Chun Yen