Conference paper
Distilling common randomness from bipartite quantum states
Igor Devetak, Andreas Winter
ISIT 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
Moses Charikar, Joseph Seffi Naor, et al.
IEEE/ACM Transactions on Networking
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence