2125 search results - page 74 / 425 » On Graph Complexity |
GD
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
VIP
2000
13 years 9 months ago
2000
This paper presents a model for describing visualisation by considering individual parts of an instance and relating them to each other. The resulting part-relationship structure ...
BIRTHDAY
2010
Springer
13 years 7 months ago
2010
Springer
The title of this paper, besides being a pun, can be taken to mean either the frontier of research in graph transformation, or the advantage of using graph transformation. To focus...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We propose a model for the World Wide Web graph that couples the topological growth with the traffic's dynamical evolution. The model is based on a simple traffic-driven dynam...
JGAA
2006
13 years 7 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...