140 search results - page 16 / 28 » Maximum Series-Parallel Subgraph |
ECML
2006
Springer
13 years 11 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
DM
2006
13 years 10 months ago
2006
Let n(G) denote the number of vertices of a graph G and let (G) be the independence number of G, the maximum number of pairwise nonadjacent vertices of G. The Hall ratio of a grap...
ICMLA
2009
13 years 7 months ago
2009
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
ICMLA
2009
13 years 7 months ago
2009
Abstract--This paper presents a novel and domainindependent approach for graph-based structure learning. The approach is based on solving the Maximum Common SubgraphIsomorphism pro...
SIAMIS
2010
13 years 4 months ago
2010
Abstract. We propose an algorithmic framework for computing global solutions of variational models with convex regularity terms that permit quite arbitrary data terms. While the mi...