50 search results - page 2 / 10 » A combinatorial algorithm for weighted stable sets in bipart... |
ALGORITHMICA
2010
13 years 5 months ago
2010
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
ESA
2004
Springer
13 years 10 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
DAM
2008
13 years 5 months ago
2008
Abstract. A graph is called equistable when there is a nonnegative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stab...
TIT
2008
13 years 5 months ago
2008
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...