Sciweavers

941 search results - page 12 / 189
» Efficient Testing of Large Graphs
Sort
View
EDBT
2004
ACM
133views Database» more  EDBT 2004»
15 years 9 months ago
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
Ralf Schenkel, Anja Theobald, Gerhard Weikum
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
15 years 10 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...
78
Voted
CORR
2002
Springer
108views Education» more  CORR 2002»
14 years 9 months ago
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...
Matthew Dickerson, David Eppstein, Michael T. Good...
ICTAC
2004
Springer
15 years 3 months ago
Minimal Spanning Set for Coverage Testing of Interactive Systems
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...
Fevzi Belli, Christof J. Budnik
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
14 years 11 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis