Benchmarks for Strictly Fundamental Cycle Bases

DOI10.1007/978-3-540-72845-0_28MaRDI QIDQ5432326zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Lower bounds for strictly fundamental cycle bases in grid graphs
• Minimum weakly fundamental cycle bases are hard to find
• On the approximability of the minimum strictly fundamental cycle basis problem
• Minimum strictly fundamental cycle bases of planar graphs are hard to find
• Algorithms for finding minimum fundamental cycle bases in graphs

Cited in

(6)

• Integral cycle bases for cyclic timetabling
• Edge-swapping algorithms for the minimum fundamental cycle basis problem
• Minimum strictly fundamental cycle bases of planar graphs are hard to find
• Lower bounds for strictly fundamental cycle bases in grid graphs
• On the minimum spanning tree distribution in grids
• Minimum cut bases in undirected networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432326)