zbMATH — the first resource for mathematics

On the complexity of edge labelings for trees. (English) Zbl 0478.68069

68R10 Graph theory (including graph drawing) in computer science
68Q25 Analysis of algorithms and problem complexity
05C05 Trees
Full Text: DOI
[1] Aho, A.V.; Hopcroft, J.E.; Ullman, J.D., The design and analysis of computer algorithms, (1974), Addison-Wesley Reading, MA · Zbl 0207.01701
[2] Garey, M.R.; Johnson, D.S., Computers and intractability: A guide to the theory of NP-completeness, (1979), Freeman San Francisco · Zbl 0411.68039
[3] Harary, F., Graph theory, (1969), Addison-Wesley Reading, MA · Zbl 0797.05064
[4] Hu, T.C., Optimal communication spanning trees, SIAM J. comput., 3, 3, 188-195, (1974) · Zbl 0269.90010
[5] D.S. Johnson, Private communication.
[6] Karp, R.M., Reducibility among combinatorial problems, (), 85-104 · Zbl 0366.68041
[7] Knuth, D.E., The art of computer programming, vol. 1: fundamental algorithms, (1968), Addison-Wesley Reading, MA · Zbl 0191.17903
[8] Lenstra, J.K.; Rinnooy Kan, A.H.G.; Johnson, D.S., The complexity of the network design problem, (1976), Mathematisch Centrum Amsterdam · Zbl 0395.94048
[9] N. Megiddo, Private communication.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.