New faster Kernighan-Lin-type graph-partitioning algorithms – Papersᵞ

Warning: MathJax requires JavaScript to process the mathematics on this page.
If your browser supports JavaScript, be sure it is enabled.

☆

1

New faster Kernighan-Lin-type graph-partitioning algorithms

https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.39.920&rep=rep1&type=pdf

Authors: Shantanu Dutt
Liked by: Maximimi
Domains: Graph mining, Graph algorithmics
Tags: ICCAD1993

Uploaded by: Maximimi
Upload date: 2020-12-23 23:01:02

Comments:

Nice algorithms! Is there any open source implementation? I'm wondering how Quick_Cut performs on large real-world graphs.

Reply

Maximimi at 2020-12-24 11:51:06