A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs

DOI10.1007/11786986_23zbMath1223.05298OpenAlexW2129660997MaRDI QIDQ3613764

Telikepalli Kavitha, Kurt Mehlhorn, Ramesh Hariharan

Publication date: 12 March 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11786986_23

zbMATH Keywords

directed graphminimum cycle basis

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Randomized algorithms (68W20)

Related Items (4)

Forward and line-based cycle bases for periodic timetabling ⋮ On a Special Co-cycle Basis of Graphs ⋮ New approximation algorithms for minimum cycle bases of graphs ⋮ Cycle bases in graphs characterization, algorithms, complexity, and applications

This page was built for publication: A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs