Faster Algorithms for Minimum Cycle Basis in Directed Graphs
From MaRDI portal
Publication:3395038
DOI10.1137/060670730zbMath1178.68669MaRDI QIDQ3395038
Telikepalli Kavitha, Kurt Mehlhorn, Ramesh Hariharan
Publication date: 20 August 2009
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c277fecf2b4070a1449a67c50e8efc08430055fd
68W40: Analysis of algorithms
05C20: Directed graphs (digraphs), tournaments
68W20: Randomized algorithms
Related Items
Cycle analysis of directed acyclic graphs, Collusion in atomic splittable routing games, A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching, Minimum Cycle Bases and Their Applications