Lower bounds to the graph partitioning problem through generalized linear programming and network flows

Michel Minoux, Éric Pinson · RAIRO - Operations Research · 1987

Lower bounds to the graph partitioning problem through generalized linear programming and network flowsRevue française d'automatique, d'informatique et de recherche opérationnelle.Recherche opérationnelle, tome 21, n o 4 (1987), p. 349-364.

Read the paper · More papers on PaperTik