๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A parallel algorithm for k-way graph partitioning

โœ Scribed by Kazunori Isomoto; Shin'Ichi Wakabayashi; Noriyoshi Yoshida; Jun-Ichi Miyao


Book ID
112079565
Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
782 KB
Volume
76
Category
Article
ISSN
1042-0967

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Serial and Parallel Algorithms for (k,2)
โœ J.A. Ellis; M. Matamontero; H. Muller ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 693 KB

We introduce a class of layered graphs which we call \((k, 2)\) partite and which we argue are an interesting class because of several important applications. We show that testing for \((k, 2)\) partiteness can be done efficiently both on sequential and parallel machines, by showing that membership

Algorithms for partitioning a graph
โœ Taehoon Park; Chae Y. Lee ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 606 KB
An exact algorithm for graph partitionin
โœ William W. Hager, Dzung T. Phan, Hongchao Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 358 KB