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.

Conference paper

Placement of multimedia blocks on zoned disks

Renu Tewari, Richard P. King, et al.

IS&T/SPIE Electronic Imaging 1996

Workshop paper

SPRIG: Stackelberg Perception-Reinforcement Learning with Internal Game Dynamics

Fernando Martinez, Juntao Chen, et al.

AAAI 2025

Conference paper

Bounds on the ergodic capacity of training-based multiple-antenna systems

Simeon Furrer, Dirk Dahlhaus

ISIT 2005

Conference paper

IT service management automation - A hybrid methodology to integrate and orchestrate collaborative human centric and automation centric workflows

Naga Ayachitula, Melissa Buco, et al.

SCC 2007

View all publications

Abstract

Related

Placement of multimedia blocks on zoned disks

SPRIG: Stackelberg Perception-Reinforcement Learning with Internal Game Dynamics

Bounds on the ergodic capacity of training-based multiple-antenna systems

IT service management automation - A hybrid methodology to integrate and orchestrate collaborative human centric and automation centric workflows