John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022