Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
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
Conference paper
Surface light-induced changes in thin polymer films
Andrew Skumanich
SPIE Optics Quebec 1993
Yi Zhou, Parikshit Ram, et al.
ICLR 2023
M. Tismenetsky
International Journal of Computer Mathematics