Minimum cycle bases and surface reconstruction

Authors:
Kurt Mehlhorn
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
GD'05 Proceedings of the 13th international conference on Graph Drawing
Year:
2005

Citing 3
Cited 0

An Õ(m2n) randomized algorithm to compute a minimum cycle basis of a directed graph

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A polynomial time algorithm for minimum cycle basis in directed graphs

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Implementing minimum cycle basis algorithms

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

I report on recent work on minimum cycle basis in graphs and their application to surface reconstruction. The talk is based on joint work with C. Gotsmann, R. Hariharan, K. Kaligosi, T. Kavitha, D. Michail, K. Paluch, and E. Pyrga. I refer the reader to [KMMP04, KM05, HKM, GKM+, MM05, Kav05] for details.