Planar Maximum Matching: Towards a Parallel Algorithm
暂无分享,去创建一个
[1] Thanh Minh Hoang. On the Matching Problem for Special Graph Classes , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.
[2] Ofer Grossman,et al. Reproducibility and Pseudo-Determinism in Log-Space , 2018, Electron. Colloquium Comput. Complex..
[3] Meena Mahajan,et al. Some perfect matchings and perfect half-integral matchings in NC , 2008, Chic. J. Theor. Comput. Sci..
[4] Meena Mahajan,et al. The combinatorial approach yields an NC algorithm for computing Pfaffians , 2004, Discret. Appl. Math..
[5] Gary L. Miller,et al. Flow in Planar Graphs with Multiple Sources and Sinks , 1995, SIAM J. Comput..
[6] Thomas Thierauf,et al. Counting the Number of Perfect Matchings in K5-Free Graphs , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[7] Igor Carboni Oliveira,et al. Pseudodeterministic constructions in subexponential time , 2016, STOC.
[8] Eric Allender,et al. Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds , 1999, J. Comput. Syst. Sci..
[9] Thomas Thierauf,et al. Bipartite perfect matching is in quasi-NC , 2016, STOC.
[10] Martin Loebl,et al. On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents , 1998, Electron. J. Comb..
[11] Raghav Kulkarni,et al. Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs , 2016, MFCS.
[12] Dana Ron,et al. On the possibilities and limitations of pseudodeterministic algorithms , 2013, ITCS '13.
[13] Shafi Goldwasser,et al. Probabilistic Search Algorithms with Unique Answers and Their Cryptographic Applications , 2011, Electron. Colloquium Comput. Complex..
[14] Piotr Sankowski,et al. NC Algorithms for Weighted Planar Perfect Matching and Related Problems , 2017, ICALP.
[15] Raghav Kulkarni,et al. Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs , 2008, Theory of Computing Systems.
[16] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[17] Vijay V. Vazirani,et al. NC Algorithms for Computing the Number of Perfect Matchings in K_3,3-Free Graphs and Related Problems , 1989, Inf. Comput..
[18] Carlos F. Barbas,et al. The Combinatorial Approach to Human Antibodies , 1994 .
[19] Meena Mahajan,et al. Planarity, Determinants, Permanents, and (Unique) Matchings , 2010, TOCT.
[20] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..
[21] Shafi Goldwasser,et al. Pseudo-deterministic Proofs , 2017, Electron. Colloquium Comput. Complex..
[22] Raghav Kulkarni,et al. Space complexity of perfect matching in bounded genus bipartite graphs , 2012, J. Comput. Syst. Sci..
[23] Wojciech Rytter,et al. Fast parallel algorithms for graph matching problems , 1998 .
[24] D. West. Introduction to Graph Theory , 1995 .
[25] Raghunath Tewari,et al. Derandomizing Isolation Lemma for $K_{3, 3}$-free and $K_5$-free Bipartite Graphs , 2014, STACS.
[26] Vijay V. Vazirani,et al. Matching is as easy as matrix inversion , 1987, STOC.
[27] Vijay V. Vazirani,et al. NC Algorithms for Computing the Number of Perfect Matchings in K3, 3-free Graphs and Related Problems , 1988, SWAT.
[28] David Eppstein,et al. NC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs , 2018, ArXiv.
[29] Ola Svensson,et al. The Matching Problem in General Graphs Is in Quasi-NC , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).