Sciweavers

712 search results - page 22 / 143
» On Spectral Graph Drawing
Sort
View
COMGEO
2004
ACM
13 years 7 months ago
How to draw the minimum cuts of a planar graph
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
Ulrik Brandes, Sabine Cornelsen, Christian Fie&szl...
GD
2003
Springer
14 years 22 days ago
Visualizing Related Metabolic Pathways in Two and a Half Dimensions
We propose a method for visualizing a set of related metabolic pathways using 21 2 D graph drawing. Interdependent, twodimensional layouts of each pathway are stacked on top of eac...
Ulrik Brandes, Tim Dwyer, Falk Schreiber
FLAIRS
2008
13 years 9 months ago
Incorporating Latent Semantic Indexing into Spectral Graph Transducer for Text Classification
Spectral Graph Transducer(SGT) is one of the superior graph-based transductive learning methods for classification. As for the Spectral Graph Transducer algorithm, a good graph re...
Xinyu Dai, Baoming Tian, Junsheng Zhou, Jiajun Che...
WADS
2007
Springer
101views Algorithms» more  WADS 2007»
14 years 1 months ago
Edges and Switches, Tunnels and Bridges
Abstract. Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the ...
David Eppstein, Marc J. van Kreveld, Elena Mumford...
ICNC
2005
Springer
14 years 1 months ago
Drawing Undirected Graphs with Genetic Algorithms
This paper proposes an improved genetic algorithm for producing aesthetically pleasing drawings of general undirected graphs. Previous undirected graph drawing algorithms draw larg...
Qing-Guo Zhang, Huayong Liu, Wei Zhang, Ya-Jun Guo