Author:
Coorg Satyan R.,Rangan C. Pandu
Subject
Computer Networks and Communications,Hardware and Architecture,Information Systems,Software
Reference11 articles.
1. Lecture Notes;Brandstadt,1985
2. The complexity of generalized clique covering
3. and , Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, San Francisco (1979).
4. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980).
5. Reducibilities among combinatorial problems. Complexity of Computer Computations ( and , Eds.). Plenum Press, New York (1972) 85–103.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献