796 search results - page 114 / 160 » The Anonymous Subgraph Problem |
137
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
127
click to vote
COLT
2003
Springer
15 years 8 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
132
click to vote
ALT
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
123
click to vote
ALGORITHMICA
2005
15 years 2 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
118
click to vote
PVLDB
2010
15 years 1 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...