Maximum weight independent set in trees
- 1 June 1987
- journal article
- Published by Springer Science and Business Media LLC in BIT Numerical Mathematics
- Vol. 27 (2), 170-180
- https://doi.org/10.1007/bf01934182
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Vertex packing algorithmsPublished by Springer Science and Business Media LLC ,2005
- Solving NP-hard problems in ‘almost trees’: Vertex coverDiscrete Applied Mathematics, 1985
- Efficient bounds for the stable set, vertex cover and set packing problemsDiscrete Applied Mathematics, 1983
- Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ TimeSIAM Journal on Computing, 1983
- Depth-first search and the vertex cover problemInformation Processing Letters, 1982
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975
- Optimal Center Location in Simple NetworksTransportation Science, 1971
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969