Sciweavers

3396 search results - page 100 / 680
» Tree representations of graphs
Sort
View
IPL
2002
105views more  IPL 2002»
13 years 8 months ago
Steiner trees in uniformly quasi-bipartite graphs
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
Clemens Gröpl, Stefan Hougardy, Till Nierhoff...
ERCIMDL
2009
Springer
167views Education» more  ERCIMDL 2009»
14 years 3 months ago
A Compressed Self-indexed Representation of XML Documents
This paper presents a structure we call XML Wavelet Tree (XWT) to represent any XML document in a compressed and self-indexed form. Therefore, any query or procedure that could be ...
Nieves R. Brisaboa, Ana Cerdeira-Pena, Gonzalo Nav...
ICDM
2003
IEEE
160views Data Mining» more  ICDM 2003»
14 years 2 months ago
Indexing and Mining Free Trees
Tree structures are used extensively in domains such as computational biology, pattern recognition, computer networks, and so on. In this paper, we present an indexing technique f...
Yun Chi, Yirong Yang, Richard R. Muntz
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
14 years 3 months ago
Mining for Tree-Query Associations in a Graph
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
Eveline Hoekx, Jan Van den Bussche
SAC
2004
ACM
14 years 2 months ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer