9572 search results - page 64 / 1915 » Cover Algorithms and Their Combination |
103
click to vote
AICCSA
2007
IEEE
15 years 6 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
IJCGA
1998
14 years 11 months ago
1998
We study the following problem: Given a collection A of polyhedral parts in 3D, determine whether there exists a subset S of the parts that can be moved as a rigid body by in nite...
121
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
FSTTCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
125
click to vote
FSTTCS
2003
Springer
15 years 5 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...