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

Joint spectral radius and path-complete graph Lyapunov functions

Amir Ali Ahmadi, Raphaël M. Jungers, et al.

SICON

Conference paper

Time development of AlGaAs single-quantum-well laser facet temperature on route to catastrophical breakdown

W.C. Tang, H. Rosen, et al.

SPIE Optics, Electro-Optics, and Laser Applications in Science and Engineering 1991

Paper

On the distance to the zero-set of a polynomial

Matthew A Grayson

Journal of Complexity

Paper

Automated search method for AFM and profilers

Michael Ray, Yves C. Martin

Proceedings of SPIE - The International Society for Optical Engineering

View all publications

Abstract

Related

Joint spectral radius and path-complete graph Lyapunov functions

Time development of AlGaAs single-quantum-well laser facet temperature on route to catastrophical breakdown

On the distance to the zero-set of a polynomial

Automated search method for AFM and profilers