Author:
Chrobak Marek,Naor Joseph,Novick Mark B.
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. M.Ben-Or and P.Tiwari, A deterministic algorithm for sparse multivariate polynomial interpolation, Proc. 20th Symposium on Theory on Computing, 1988, pp. 301–309.
2. J. Edmonds, Paths, trees and flowers, Canad. J. Math. 17 (1965) 449–467.
3. D. Y. Grigoriev and M. Karpiński, The matching problem for bipartite graphs with polynomially bounded permanents is in NC, 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, CA, 1987, pp. 166–172.
4. F. Harary, Graph Theory, Addison-Wesley Publishing Company, 1972.
5. Xin He, Private communication.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On some graphs with a unique perfect matching;Information Processing Letters;2018-11
2. On the Parameterized Parallel Complexity and the Vertex Cover Problem;Combinatorial Optimization and Applications;2016
3. Line-of-Sight Networks;Combinatorics, Probability and Computing;2009-03
4. Small degree out-branchings;Journal of Graph Theory;2003-02-24