Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi. Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. In Friedrich Eisenbrand, F. Bruce Shepherd, editors, Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings. Volume 6080 of Lecture Notes in Computer Science, pages 397-410, Springer, 2010. [doi]

This author has not been identified. Look up 'Edoardo Amaldi' in GoogleThis author has not been identified. Look up 'Claudio Iuliano' in GoogleThis author has not been identified. Look up 'Romeo Rizzi' in Google

runs on WebDSL