Sciweavers

712 search results - page 86 / 143
» On Spectral Graph Drawing
Sort
View
AGTIVE
1999
Springer
14 years 1 months ago
Graph Algorithm Animation with Grrr
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming l...
Peter J. Rodgers, Natalia Vidal
ISCI
2007
96views more  ISCI 2007»
13 years 8 months ago
A new algorithm for removing node overlapping in graph visualization
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...
Xiaodi Huang, Wei Lai, A. S. M. Sajeev, Junbin Gao
ICALP
2007
Springer
14 years 3 months ago
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
Michael R. Fellows, Guillaume Fertin, Danny Hermel...
ICML
2003
IEEE
14 years 9 months ago
Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
Xiaojin Zhu, Zoubin Ghahramani, John D. Lafferty
VL
2005
IEEE
107views Visual Languages» more  VL 2005»
14 years 2 months ago
Navigating Software Architectures with Constant Visual Complexity
Abstract— Visualizing software architecture faces the challenges of both data complexity and visual complexity. This paper presents an approach for visualizing software architect...
Wanchun Li, Peter Eades, Seok-Hee Hong