Subject
General Computer Science,Theoretical Computer Science
Reference19 articles.
1. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms;Booth;J. Comput. System Sci.,1976
2. A greedy heuristic for the set-covering problem;Chvatal;Math. Oper. Res.,1979
3. A methodology for design of digital systems — supported by SARA at the age of one;Estrin;Proc. of National Computer Conference,1978
4. An ADA to standard cell hardware compiler based on graph grammars and scheduling;Girczyc;Proc. of the ICCD,1984
5. Efficient algorithms for interval graphs and circular-arc graphs;Gupta;Networks,1982
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献