L Auslander, E Feig, et al.
Advances in Applied Mathematics
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
Naga Ayachitula, Melissa Buco, et al.
SCC 2007
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization