Experimental and Efficient Algorithms

DOI10.1007/b136461zbMath1121.05314OpenAlexW2485841483MaRDI QIDQ5710059

Dimitrios Michail, Kurt Mehlhorn

Publication date: 30 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Cycle analysis of directed acyclic graphs ⋮ An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs

This page was built for publication: Experimental and Efficient Algorithms