The Complexity of Determing a Shortest Cycle of Even Length

Burkhard Monien. The Complexity of Determing a Shortest Cycle of Even Length. In H.-J. Schneider, Herbert Göttler, editors, Proceedings of the 8th Conference Graphtheoretic Concepts in Computer Science (WG '82), Neuenkirchen (near Erlangen), Germany. pages 195-208, Hanser, Munich, 1982.

Abstract

Abstract is missing.