Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
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
Charles A Micchelli
Journal of Approximation Theory
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics