Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Paper
A linear-time algorithm for computing the intersection of all odd cycles in a graph
Abstract
We present a linear-time algorithm that finds all edges and vertices in the intersection of all odd cycles in a given graph. We also show an application of our algorithm to a variant of the satisfiability problem of Boolean formulas.
Related
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Charles Micchelli
Journal of Approximation Theory
Moutaz Fakhry, Yuri Granik, et al.
SPIE Photomask Technology + EUV Lithography 2011