Sciweavers

638 search results - page 25 / 128
» Track Layouts of Graphs
Sort
View
TCAD
2002
110views more  TCAD 2002»
14 years 9 months ago
A constructive genetic algorithm for gate matrix layout problems
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Gate Matrix Layout Problem (GMLP). The GMLP happens in very large scale integration (VLSI) desi...
Alexandre César Muniz de Oliveira, Luiz Ant...
DM
2002
104views more  DM 2002»
14 years 9 months ago
A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...
Brigitte Servatius, Herman Servatius
SAC
2005
ACM
15 years 3 months ago
Discovering parametric clusters in social small-world graphs
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different resear...
Jonathan McPherson, Kwan-Liu Ma, Michael Ogawa
COCOON
2003
Springer
15 years 2 months ago
On Spectral Graph Drawing
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an abili...
Yehuda Koren
IV
2002
IEEE
85views Visualization» more  IV 2002»
15 years 2 months ago
Fillets: Cues for Connections in Focus+Context Views of Graph-Like Diagrams
We apply fillets — smoothing of sharp angles at the joints — between the connections and nodes of graph-like diagrams. In situations where the graph layout is constrained, e....
Tuomas J. Lukka, Janne V. Kujala, Marketta Niemel&...