Sciweavers

3105 search results - page 166 / 621
» The Path-Packing Structure of Graphs
Sort
View
105
Voted
COMBINATORICA
2006
125views more  COMBINATORICA 2006»
15 years 3 months ago
Coloring Subgraphs of the Rado Graph
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...
Norbert W. Sauer
142
Voted
SAC
2006
ACM
15 years 9 months ago
MTree: an XML XPath graph index
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
P. Mark Pettovello, Farshad Fotouhi
142
Voted
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 9 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
KDD
2009
ACM
132views Data Mining» more  KDD 2009»
16 years 4 months ago
Learning patterns in the dynamics of biological networks
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
Chang Hun You, Lawrence B. Holder, Diane J. Cook
131
Voted
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
15 years 5 months ago
Metric forensics: a multi-level approach for mining volatile graphs
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
Keith Henderson, Tina Eliassi-Rad, Christos Falout...