M.W Bern
- Linear-time computation of optimal subgraphs of decomposable graphs
1987/06/01 by Marshall Bern, M.W Bern, Eugene L. Lawler +3 · 10 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Graph Theory and Algorithms #Matching (statistics) #Mathematics #Time complexity #Travelling salesman problem