A linear-time algorithm for computing the intersection of all odd cycles in a graph

Leizhen Cai; Baruch Schieber

doi:10.1016/S0166-218X(96)00074-1

Discrete Applied Mathematics

Paper

21 Feb 1997

A linear-time algorithm for computing the intersection of all odd cycles in a graph

View publication

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.

Paper

An information statistics approach to data stream and communication complexity

Ziv Bar-Yossef, T.S. Jayram, et al.

Journal of Computer and System Sciences

Paper

Can one always lower topological entropy?

M. Shub, B. Weiss

Ergodic Theory and Dynamical Systems

Paper

Exploring context and content links in social media: A latent space method

Guo-Jun Qi, Charu Aggarwal, et al.

IEEE TPAMI

Paper

Irredundancy in circular arc graphs

Martin Charles Golumbic, Renu C. Laskar

Discrete Applied Mathematics

View all publications

Abstract

Related

An information statistics approach to data stream and communication complexity

Can one always lower topological entropy?

Exploring context and content links in social media: A latent space method

Irredundancy in circular arc graphs