Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ
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
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings