60 search results - page 3 / 12 » On embeddability and stresses of graphs |
IV
2002
IEEE
14 years 9 days ago
2002
IEEE
We present a preprocessor for the spring embedder graph drawing method and show its use in speeding up the automatic layout of three-dimensional visualizations of WWW sites. Sprin...
BMCBI
2010
13 years 7 months ago
2010
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
GD
2005
Springer
14 years 28 days ago
2005
Springer
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 ...
CSR
2008
Springer
13 years 9 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
IV
2003
IEEE
14 years 20 days ago
2003
IEEE
This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in...