Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
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
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
Conference paper
Characterization of a next generation step-and-scan system
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007