Author:
Rao Arikati Srinivasa,Pandu Rangan C.
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference12 articles.
1. On covering the points of a graph with point disjoint paths;Boesch,1974
2. Minimum node disjoint path covering for circular-arc graphs;Bonuccelli;Inform. Process. Lett.,1979
3. Testing for the consecutive ones property, interval graph and graph planarity using PQ-tree algorithms;Booth;J. Comput. System Sci.,1976
4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
5. Algorithmic Graph Theory and Perfect Graphs;Golumbic,1980
Cited by
74 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献