Heng Cao, Haifeng Xi, et al.
WSC 2003
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
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Conference paper
Modeling UpLink power control with outage probabilities
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007