Relaxations and Solutions for the Minimum Graph Bisection Problem

By Marzena F|genschuh

The minimum graph bisection problem is a special kind of a graph partitioning problem, where the nodes of a weighted graph are divided into two subsets with prescribed capacity, and the weighted sum... This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 3832517359
• ISBN13: 9783832517359
• Release Date: November 2007
• Publisher: Logos Verlag Berlin
• Length: 241 Pages