Sciweavers

941 search results - page 7 / 189
» Efficient Testing of Large Graphs
Sort
View
DEDS
2002
106views more  DEDS 2002»
14 years 11 months ago
Efficient Computation and Representation of Large Reachability Sets for Composed Automata
We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized com...
Peter Buchholz, Peter Kemper
60
Voted
GD
2007
Springer
15 years 5 months ago
Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
Giuseppe Di Battista, Fabrizio Frati
JGAA
2007
93views more  JGAA 2007»
14 years 11 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
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
15 years 3 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...
TVCG
2011
100views more  TVCG 2011»
14 years 6 months ago
Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths
—Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place t...
Daniel Archambault, Tamara Munzner, David Auber