1988/06/01 by Burkhard Monien, B. Monien, I. Hal Sudborough +1 · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Completeness (order theory) #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Feedback vertex set #Graph #Interconnection Networks and Systems #Mathematics #Maximum cut #NP-complete #Planar #Planar graph #Steiner tree problem #Time complexity #Vertex (graph theory)
paper · doi:10.1016/0304-3975(88)90028-x
crossref issued 1988/06/01 · crossref published 1988/06/01 · crossref published-print 1988/06/01 · openalex publication_date 1988/06/01 · crossref created 2002/07/25 · crossref deposited 2019/04/12 · openalex created_date 2025/10/10 · crossref indexed 2026/02/19 · openalex updated_date 2026/07/23