On finding a minimum vertex cover of a series-parallel graph
From MaRDI portal
Publication:758196
DOI10.1016/0893-9659(89)90075-XzbMath0724.68032OpenAlexW2019119668MaRDI QIDQ758196
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of comparability graph recognition and coloring
- The Recognition of Series Parallel Digraphs
- Linear-time computability of combinatorial problems on series-parallel graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph