Publisher
Springer Berlin Heidelberg
Reference3 articles.
1. Karp, R. M., "Reducibility Among Combinatorial Problems," Complexity of Computer Computations (R. Miller and J. Thatcher, Eds.)
2. Harary, F., and Schwenk, A., "Evolution of the Path Number of a Graph, Covering and Packing in Graphs, II," Graph Theory and Computing (R.C. Read, ed.) Academic Press, New York, 1972, 39–45.
3. Boesch, F. T., Chen, S., and McHugh, N.A.M., "On Covering the Points of a Graph with Point Disjoint Paths," this volume p. 201.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献