Sciweavers

715 search results - page 14 / 143
» On graphs with subgraphs having large independence numbers
Sort
View
GD
2004
Springer
14 years 26 days ago
QUOGGLES: Query On Graphs - A Graphical Largely Extensible System
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
Paul Holleis, Franz-Josef Brandenburg
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
14 years 7 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
JGT
2007
130views more  JGT 2007»
13 years 7 months ago
Vertex partitions and maximum degenerate subgraphs
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
Martín Matamala
PVLDB
2008
108views more  PVLDB 2008»
13 years 7 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
13 years 7 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang