Author:
Brown Donna J.,Fellows Michael R.,Langston Michael A.
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Science Applications
Reference33 articles.
1. Bryant, R. L., Fellows, M. R., Kinnersley, N. G. and Langston, M. A. 1987.Proc. 25th Allerton Conf. on Communication, Control, and Computing. On finding obstruction sets and polynomial-time algorithms for gate matrix layout. 1987. pp.397–398.
2. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
3. Knots and links in spatial graphs
4. Exact and Approximate Solutions for the Gate Matrix Layout Problem
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献