The $(2,k)$-connectivity augmentation problem: Algorithmic aspects

April 18, 2020 · The Ethereal · 🏛 Algorithmica

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Florian Hörsch, Zoltán Szigeti arXiv ID 2004.08645 Category math.CO: Combinatorics Cross-listed cs.DM, cs.DS Citations 0 Venue Algorithmica Last Checked 3 months ago
Abstract
Durand de Gevigney and Szigeti \cite{DgGSz} have recently given a min-max theorem for the $(2,k)$-connectivity augmentation problem. This article provides an $O(n^3(m+ n \textrm{ }log\textrm{ }n))$ algorithm to find an optimal solution for this problem.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Combinatorics

🔮 🔮 The Ethereal

Tables of subspace codes

Daniel Heinlein, Michael Kiermaier, ... (+2 more)

math.CO 🏛 arXiv 📚 94 cites 10 years ago