Algorithms to compute minimum cycle basis in directed graphs
From MaRDI portal
Publication:2643144
DOI10.1007/s00224-006-1319-6zbMath1121.68087MaRDI QIDQ2643144
Telikepalli Kavitha, Kurt Mehlhorn
Publication date: 23 August 2007
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-006-1319-6
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A Family of Tree-Based Generators for Bubbles in Directed Graphs, A family of tree-based generators for bubbles in directed graphs, On bubble generators in directed graphs, New approximation algorithms for minimum cycle bases of graphs, Properties of Gomory-Hu co-cycle bases, Cycle analysis of directed acyclic graphs, On a Special Co-cycle Basis of Graphs, Minimum Cycle Bases and Their Applications