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

DOI10.1016/0893-9659(89)90075-XMaRDI QIDQ758196zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 3845637 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Linear-time computability of combinatorial problems on series-parallel graphs
• The Recognition of Series Parallel Digraphs
• The complexity of comparability graph recognition and coloring

Cited in

(3)

• scientific article; zbMATH DE number 6254006 (Why is no real title available?)
• scientific article; zbMATH DE number 7378361 (Why is no real title available?)
• scientific article; zbMATH DE number 5543290 (Why is no real title available?)

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)