I.H. Sudborough

1. The Vertex Separation and Search Number of a Graph
   1994/08/01 by John Ellis, J.A. Ellis, I.H. Sudborough +3 · 14 citations
   Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Feedback vertex set #Graph #Interconnection Networks and Systems #Mathematics #Time complexity #Vertex (graph theory)
2. Min cut is NP-complete for edge weighted trees
   1988/06/01 by Burkhard Monien, B. Monien, I.H. 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)