Sciweavers

193 search results - page 7 / 39
» The structure of almost all graphs in a hereditary property
Sort
View
ARSCOM
2007
82views more  ARSCOM 2007»
13 years 8 months ago
Extremal properties of (1, f)-odd factors in graphs
Let G be a simple graph and f : V (G) → {1, 3, 5, ...} an odd integer valued function defined on V (G). A spanning subgraph F of G is called a (1, f)odd factor if dF (v) ∈ {1...
Qinglin Roger Yu, Zhao Zhang
ICIP
2009
IEEE
14 years 9 months ago
Exploiting Local Structure For Tracking Plant Cells In Noisy Images
In this paper, we present a local graph matching based method for tracking cells and cell divisions in noisy images. We work with plant cells, where the cells are tightly clustere...
DAM
1999
81views more  DAM 1999»
13 years 8 months ago
On the Extension of Bipartite to Parity Graphs
Parity graphs form a superclass of bipartite and distance-hereditary graphs. Since their introduction, all the algorithms proposed as solutions to the recognition problem and othe...
Serafino Cicerone, Gabriele Di Stefano
CPHYSICS
2008
88views more  CPHYSICS 2008»
13 years 8 months ago
Simulation approaches to soft matter: Generic statistical properties vs. chemical details
The relation between atomistic structure, architecture, molecular weight and material properties is a basic concern of modern soft material science. This by now goes far beyond st...
Matej Praprotnik, Christoph Junghans, Luigi Delle ...
EDBT
2009
ACM
138views Database» more  EDBT 2009»
14 years 3 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou