On finding a minimum vertex cover of a series-parallel graph

DOI10.1016/0893-9659(89)90075-XzbMATH Open0724.68032OpenAlexW2019119668MaRDI QIDQ758196FDOQ758196

Authors: Ioannis G. Tollis 

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0893-9659(89)90075-x

zbMATH Keywords

linear time algorithmminimum vertex cover for series-parallel graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• The Recognition of Series Parallel Digraphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• The complexity of comparability graph recognition and coloring
• Linear-time computability of combinatorial problems on series-parallel graphs
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On finding a minimum vertex cover of a series-parallel graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758196)