Sciweavers

1402 search results - page 160 / 281
» Searching Cycle-Disjoint Graphs
Sort
View
GECCO
2003
Springer
100views Optimization» more  GECCO 2003»
15 years 3 months ago
Dense and Switched Modular Primitives for Bond Graph Model Design
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
Kisung Seo, Zhun Fan, Jianjun Hu, Erik D. Goodman,...
ICDM
2002
IEEE
178views Data Mining» more  ICDM 2002»
15 years 3 months ago
gSpan: Graph-Based Substructure Pattern Mining
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...
Xifeng Yan, Jiawei Han
WWW
2009
ACM
15 years 10 months ago
Graph based crawler seed selection
This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper...
Shuyi Zheng, Pavel Dmitriev, C. Lee Giles
SAS
2009
Springer
212views Formal Methods» more  SAS 2009»
15 years 10 months ago
The Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
Martin Wehrle, Malte Helmert
SAC
2004
ACM
15 years 3 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