A. Skumanich
SPIE OE/LASE 1992
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. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Conference paper
True 3-D displays for avionics and mission crewstations
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997