Min Cut is NP-complete for edge weighted trees
- 1 January 1986
- book chapter
- Published by Springer Nature
- p. 265-274
- https://doi.org/10.1007/3-540-16761-7_76
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Minimizing width in linear layoutsPublished by Springer Nature ,2005
- Topological BandwidthSIAM Journal on Algebraic Discrete Methods, 1985
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted TreesSIAM Journal on Computing, 1985
- White pebbles helpPublished by Association for Computing Machinery (ACM) ,1985
- A comparison of two variations of a pebble game on graphsTheoretical Computer Science, 1981
- The Pebbling Problem is Complete in Polynomial SpaceSIAM Journal on Computing, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978
- On Time Versus SpaceJournal of the ACM, 1977
- Storage requirements for deterministic polynomialtime recognizable languagesJournal of Computer and System Sciences, 1976