Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. Linear algorithm for optimal path cover problem on interval graphs;Arikati;Inform. Process. Lett.,1990
2. F.T. Boesch, S. Chen, J.A.M. McHugh, On covering the points of a graph with point disjoint paths, in: Proc. 1973 Capital Conf. on Graph Theory and Combinatorics, 1974, pp. 201–212.
3. Covering the points of a digraph with point disjoint paths and its application to code optimaization;Boesch;J. ACM,1977
4. Minimum node disjoint path covering for circular-arc graphs;Bonuccelli;Inform. Process. Lett.,1979
5. The L(2,1)-labeling problem on graphs;Chang;SIAM J. Discrete Math.,1996
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献