Breaking the O(m 2 n) Barrier for Minimum Cycle Bases
From MaRDI portal
Publication:3639255
DOI10.1007/978-3-642-04128-0_28zbMath1256.68080OpenAlexW1563044543MaRDI QIDQ3639255
Tomasz Jurkiewicz, Edoardo Amaldi, Claudio Iuliano, Kurt Mehlhorn, Romeo Rizzi
Publication date: 29 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04128-0_28
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Related Items
Minimum cycle bases of weighted outerplanar graphs ⋮ Forward and line-based cycle bases for periodic timetabling ⋮ Testing connectivity of faulty networks in sublinear time ⋮ Cycle bases in graphs characterization, algorithms, complexity, and applications ⋮ Certifying algorithms ⋮ Properties of Gomory-Hu co-cycle bases
