Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference6 articles.
1. F. Berman, T. Leighton, P. W. Shor, and L. Snyder, Generalised planar matching.
2. Ordered matchings without alternating cycles in bipartite graphs;Chaty;Utilitas Math.,1979
3. M. E. Dyer and A. M. Frieze, On the complexity of partitioning graphs into connected subgraphs, Discrete Appl. Math., in press.
4. Computers and Intractability;Garey,1979
5. Planar formulae and their uses;Lichtenstein;SIAM J. Comput.,1982
Cited by
100 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献