Skip to Main content Skip to Navigation
Reports

Study of the article: " An O(k2n2) 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
Complete list of metadata

https://hal.inria.fr/hal-00998313
Contributor : Ludovic Hofer Connect in order to contact the contributor
Submitted on : Sunday, June 1, 2014 - 4:22:48 PM
Last modification on : Monday, December 20, 2021 - 4:50:12 PM
Long-term archiving on: : Monday, September 1, 2014 - 10:41:24 AM

File

report.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00998313, version 1

Citation

Ludovic Hofer, Lambert Thibaud. Study of the article: " An O(k2n2) Algorithm to Find a k -partition in a k -connected Graph ". [University works] Université de bordeaux. 2014. ⟨hal-00998313v1⟩

Share

Metrics

Record views

139

Files downloads

215