✦ LIBER ✦

Algorithm 28 algorithm for generating graphs of a given partition

✍ Scribed by K. R. James; W. Riha

Publisher: Springer Vienna
Year: 1976
Tongue: English
Weight: 312 KB
Volume: 16
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02241986

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for partitioning a graph

✍ Taehoon Park; Chae Y. Lee 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 606 KB

Algorithms for generating labelled graph

Algorithms for generating labelled graphs with given degree

✍ V. Fack; J. Van der Jeugt 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 605 KB

A linear time algorithm for graph partit

A linear time algorithm for graph partition problems

✍ L.H. Clark; F. Shahrokhi; L.A. Székely 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 483 KB

A class of bounded approximation algorit

A class of bounded approximation algorithms for graph partitioning

✍ Thomas A. Feo; Mallek Khellaf 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 847 KB

An algorithm for generating minimal cuts

An algorithm for generating minimal cutsets of undirected graphs

✍ Shin, Yong Yeon ;Koh, Jai Sang 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 250 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