743 search results - page 135 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
122
click to vote
ALT
2010
Springer
15 years 3 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 ...
143
click to vote
ICCAD
1999
IEEE
15 years 6 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
156
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
121
click to vote
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
140
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...