The graph bisection minimization problem
A method of determining a lower bound for the graph bisection minimization problem is described. The bound is valid for weigthed graphs with edge and node weights. The approach is based on Lagrangian relaxation and was previously used for determining an upper bound on the independence number of a gr...
| Autor principal: | |
|---|---|
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2003
|
| Assuntos: | |
| Texto completo: | http://scielo.pt/scielo.php?script=sci_arttext&pid=S0874-51612003000100006 |
| País: | Portugal |
| Oai: | oai:scielo:S0874-51612003000100006 |