Partitioning trees: Matching, domination, and maximum diameter
- 1 February 1981
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 10 (1) , 55-61
- https://doi.org/10.1007/bf00978378
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- Two-Commodity FlowJournal of the ACM, 1978
- A Linear Tree Partitioning AlgorithmSIAM Journal on Computing, 1977
- b-Matchings in TreesSIAM Journal on Computing, 1976
- A linear algorithm for the domination number of a treeInformation Processing Letters, 1975
- An O (N2.5) algorithm for maximum matching in general graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Letter to the Editor—On Finding the Absolute and Vertex Centers of a Tree with DistancesTransportation Science, 1974