Benchmarks for Strictly Fundamental Cycle Bases

DOI10.1007/978-3-540-72845-0_28zbMath1203.68126OpenAlexW2134255492MaRDI QIDQ5432326

Ekkehard Köhler, Romeo Rizzi, Gregor Wünsch, Christian Liebchen, Alexander Reich

Publication date: 2 January 2008

Published in: Experimental Algorithms (Search for Journal in Brave)

Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15625

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Minimum cut bases in undirected networks ⋮ Integral cycle bases for cyclic timetabling ⋮ Edge-swapping algorithms for the minimum fundamental cycle basis problem

This page was built for publication: Benchmarks for Strictly Fundamental Cycle Bases