Skip to Main content Skip to Navigation
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
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-00998313
Contributor : Ludovic Hofer <>
Submitted on : Wednesday, February 10, 2016 - 11:48:10 AM
Last modification on : Thursday, January 11, 2018 - 6:20:17 AM
Long-term archiving on: : Saturday, November 12, 2016 - 3:53:01 PM

Files

report.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00998313, version 2

Collections

Citation

Olivier Baudon. Study of the article: " An O(k 2 n 2 ) Algorithm to Find a k-partition in a k-connected Graph ". [University works] Université de bordeaux. 1994. ⟨hal-00998313v2⟩

Share

Metrics

Record views

132

Files downloads

215