Author:
Parley Arthur,Hedetniemi Stephen,Proskurowski Andrzej
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science,Information Systems,Theoretical Computer Science,Software
Reference8 articles.
1. E. J. Cockayne, S. E. Goodman, and S. T. Hedetniemi, ?A linear algorithm for the domination number of a tree,?Inform. Process. Lett. 4:41?44 (1975).
2. S. Even and O. Kariv, ?An O(n2.5) algorithm for maximum matching in graphs,? Proceedings, 16th Symposium on Foundation of Computing (1975), pp. 382?399.
3. M. R. Garey and D. S. Johnson,Computers and Interactibility: A Guide to the Theory of NP-completeness (W. H. Freeman, San Francisco, 1979).
4. S. E. Goodman, S. T. Hedetniemi, and R. E. Tarjan, ?B-matchings in trees,?SIAM J. Comput. 5:104?107 (1976).
5. S. Halfin, ?On finding the absolute and vertex centers of a tree with distances,?Transport. Sci. 8:75?77 (1974).
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献