1963 search results - page 9 / 393 » The Maximum Solution Problem on Graphs |
JDA
2007
13 years 8 months ago
2007
In this paper, we deal with the maximum integer multiflow and the minimum multicut problems in rectilinear grid graphs with uniform capacities on the edges. The first problem is...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
ALENEX
2009
13 years 9 months ago
2009
In this paper we present an experimental study of several maximum flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real world pr...
ORL
2007
13 years 8 months ago
2007
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...