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.

Workshop paper

SPRIG: Stackelberg Perception-Reinforcement Learning with Internal Game Dynamics

Fernando Martinez, Juntao Chen, et al.

AAAI 2025

Paper

Airy stress function for atomic models

Paul J. Steinhardt, P. Chaudhari

Journal of Computational Physics

Conference paper

Wavefront and caustic surfaces of refractive laser beam shaper

David L. Shealy, John A. Hoffnagle

SPIE Optical Engineering + Applications 2007

Paper

Irredundancy in circular arc graphs

Martin Charles Golumbic, Renu C. Laskar

Discrete Applied Mathematics

View all publications

Abstract

Related

SPRIG: Stackelberg Perception-Reinforcement Learning with Internal Game Dynamics

Airy stress function for atomic models

Wavefront and caustic surfaces of refractive laser beam shaper

Irredundancy in circular arc graphs