Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
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
Improved approximations of crossings in graph drawings
Guy Even, Sudipto Guha, et al.
STOC 2000
Conference paper
Reasoning about RoboCup soccer narratives
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Conference paper
Wavefront and caustic surfaces of refractive laser beam shaper
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007