R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications
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
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
Conference paper
Reasoning about RoboCup soccer narratives
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011