Sciweavers

463 search results - page 7 / 93
» A General Framework for Graph Sparsification
Sort
View
SIGMOD
2012
ACM
276views Database» more  SIGMOD 2012»
11 years 10 months ago
SCARAB: scaling reachability computation on large graphs
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
Ruoming Jin, Ning Ruan, Saikat Dey, Jeffrey Xu Yu
KDD
2007
ACM
154views Data Mining» more  KDD 2007»
14 years 8 months ago
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and m...
Sitaram Asur, Srinivasan Parthasarathy, Duygu Ucar
TAGT
1998
Springer
243views Graph Theory» more  TAGT 1998»
13 years 12 months ago
Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
Hartmut Ehrig, Reiko Heckel, Mercè Llabr&ea...
CEAS
2006
Springer
13 years 11 months ago
An Email and Meeting Assistant Using Graph Walks
We describe a framework for representing email as well as meeting information as a joint graph. In the graph, documents and meeting descriptions are connected via other nontextual...
Einat Minkov, William W. Cohen
GD
1998
Springer
13 years 12 months ago
A Framework for Drawing Planar Graphs with Curves and Polylines
We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties...
Michael T. Goodrich, Christopher G. Wagner