Sankar Basu
Journal of the Franklin Institute
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
Modeling UpLink power control with outage probabilities
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
Yixiong Chen, Weichuan Fang
Engineering Analysis with Boundary Elements