B. Monien
- Min cut is NP-complete for edge weighted trees
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)