Sciweavers

23 search results - page 2 / 5
» A Treemap Based Method for Rapid Layout of Large Graphs
Sort
View
JGAA
2007
93views more  JGAA 2007»
13 years 5 months ago
Large-Graph Layout Algorithms at Work: An Experimental Study
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
Stefan Hachul, Michael Jünger
BMCBI
2007
265views more  BMCBI 2007»
13 years 5 months ago
Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
Tobias Wittkop, Jan Baumbach, Francisco P. Lobo, S...
COMGEO
2004
ACM
13 years 5 months ago
A multi-dimensional approach to force-directed layouts of large graphs
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobou...
GD
2008
Springer
13 years 6 months ago
Rapid Multipole Graph Drawing on the GPU
Abstract. As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the...
Apeksha Godiyal, Jared Hoberock, Michael Garland, ...
IV
2009
IEEE
128views Visualization» more  IV 2009»
13 years 12 months ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber