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

DOI10.1016/S0166-218X(96)00074-1zbMath0867.05066MaRDI QIDQ674917

Baruch Schieber, Leizhen Cai

Publication date: 3 August 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

satisfiabilityodd cyclelinear-time algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Negative (and positive) circles in signed graphs: a problem collection ⋮ Parameterized Complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some simplified NP-complete graph problems
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Fixed-Parameter Tractability and Completeness I: Basic Results
• The complexity of satisfiability problems

This page was built for publication: A linear-time algorithm for computing the intersection of all odd cycles in a graph