𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The optimal graph partitioning problem

✍ Scribed by Søren Holm; Michael Malmros Sørensen

Publisher
Springer
Year
1993
Tongue
German
Weight
791 KB
Volume
15
Category
Article
ISSN
0171-6468

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The bottleneck graph partition problem
The bottleneck graph partition problem
✍ Hochbaum, Dorit S.; Pathria, Anu 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB 👁 2 views

The bottleneck graph partition problem is to partition the nodes of a graph into two equally sized sets, so that the maximum edge weight in the cut separating the two sets is minimum. Whereas the graph partition problem, where the sum of the edge weights in the cut is to be minimized, is NP-hard, th

A graph partition problem
A graph partition problem
✍ Yanpei Liu; Morgana Aurora; Simeone Bruno 📂 Article 📅 1996 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 584 KB
A modified noising algorithm for the gra
A modified noising algorithm for the graph partitioning problem
✍ V. Sudhakar; C. Siva Ram Murthy 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 804 KB

Many heuristics such as iterative improvement and simulated annealing are available in the literature which try to give a near-optimal solution to the graph partitioning problem. Recently, a new method called the noising method has been proposed for solving combinatorial optimization problems. The n