| HAL-Inria | Publications, software ... of Inria's scientists |
Reports
Study of the article: " An O(k 2 n 2 ) Algorithm to Find a k-partition in a k-connected Graph "
Abstract : This report study an O(k2n2) algorithm proposed to find k-partition in a k-connected graph. A counter-example is exhibited for which the execution of the algorithm might loop endlessly. Then a proof is given which generalize the counter-example for any k.
Keywords :
Graph partitioning
Cited literature [10 references]
https://hal.inria.fr/hal-00998313
Contributor : Ludovic Hofer Connect in order to contact the contributor
Submitted on : Wednesday, February 10, 2016 - 11:48:10 AM
Last modification on : Saturday, June 25, 2022 - 10:36:26 AM
Long-term archiving on: : Saturday, November 12, 2016 - 3:53:01 PM
Contributor : Ludovic Hofer Connect in order to contact the contributor
Submitted on : Wednesday, February 10, 2016 - 11:48:10 AM
Last modification on : Saturday, June 25, 2022 - 10:36:26 AM
Long-term archiving on: : Saturday, November 12, 2016 - 3:53:01 PM
Files
report.pdf
Files produced by the author(s)