The combinatorial approach yields an NC algorithm for computing Pfaffians

Discrete Applied Mathematics

Volumn 143, Issue 1-3, 2004, Pages 1-16

  Mahajan, Meena ^a   Subramanya, P R ^b   Vinay, V ^b  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Algorithm; Combinatorics; Matching; NC; Pfaffian

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING;

COMBINATORICS; MATCHING; PFAFFIAN; PLANAR GRAPHS;

GRAPH THEORY;

EID: 4243170051     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.12.001     Document Type: Article

References (25)

1. E. Allender, M. Mahajan, The complexity of planarity testing, in: H. Reichel, S. Tison (Eds.), Proceedings of the Symposium on Theoretical Aspects of Computing (STACS), Lecture Notes in Computer Science, Vol. 1770, Springer, Berlin, 2000; Inform. Comput., to appear.
2. Allender E., Rheinhardt K., Zhou S. Isolation, matching and counting. uniform and nonuniform upper bounds J. Comput. System Sci. 59:1999;164-181.
3. F. Barahona, Balancing signed toroidal graphs in polynomial time, Preprint, University of Chile, 1983.
4. Camerini P.M., Galbiati G., Maffioli F. Random pseudo-polynomial algorithms for exact matroid problems. J. Algorithms. 13:1992;258-273.
5. (#L), Technical Report Informatik, Preprint 8, Fachbereich Informatik der Humboldt, Universität zu Berlin, 1991.
6. Galbiati G., Maffioli F. On the computation of Pfaffians. Discrete Appl. Math. 51:1994;269-275.
7. A. Galluccio, M. Loebl, On the theory of Pfaffian orientations I: perfect matchings and permanents, Electron. J. Combin. (1999) R6.
8. Kastelyn P.W. Graph theory and crystal physics. Harary F. Graph Theory and Theoretical Physics. 1967;43-110 Academic Press, New York.
9. Knuth D.E. Overlapping Pfaffians. Electron. J. Combin. 3(2):1996;R5.
10. Lang S. Algebra. 1965;Addison-Wesley, Reading, MA.
11. C.H.C. Little, An extension of Kasteleyn's method of enumerating the 1-factors of planar graphs, in: D. Holton (Ed.), Combinatorial Mathematics, Proceedings of the Second Australian Conference, Lecture Notes in Mathematics, Vol. 403, Springer, Berlin, 1974, pp.63-72.
12. L. Lovasz, M. Plummer, Matching Theory, North-Holland, Amsterdam, 1986, Ann. Discrete Math. 29 (1986).
13. M. Mahajan, K. Varadarajan, A new NC-algorithm for finding a perfect matching in planar and bounded genus graphs, in: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), Portland, OR, 2000, pp. 351-357.
14. M. Mahajan, V. Vinay, Determinant: combinatorics, algorithms, complexity, Chicago J. Theoret. Comput. Sci. http://www.cs.uchicago.edu/publications/cjtcs, 1997:5, December 1997; Preliminary version in Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, New Orleans, USA, 1997, pp. 730-738.
15. M. Mahajan, V. Vinay, Determinant: combinatorics, algorithms, complexity, Chicago J. Theoret. Comput. Sci. http://www.cs.uchicago.edu/publications/cjtcs, 1997:5, December 1997; Preliminary version in Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, New Orleans, USA, 1997, pp. 730-738.
16. Miller G., Naor J. Flow in planar graphs with multiple sources and sinks. SIAM J. Comput. 24:1995;1002-1017.
17. Mulmuley K., Vazirani U., Vazirani V. Matching is as easy as matrix inversion. Combinatorica. 7(1):1987;105-131.
18. Ramachandran V., Reif J. Planarity testing in parallel. J. Comput. System Sci. 49:1994;517-561.
19. Rote G. Division-free algorithms for the determinant and the pfaffian: algebraic and combinatorial approaches. Alt H. Computational Discrete Mathematics: Advanced Lectures. Lecture Notes in Computer Science. Vol. 2122:2001;119-135 Springer, Berlin.
20. S. Toda, Counting problems computationally equivalent to the determinant, Technical Report CSIM 91-07, Department of Computer Science and Information Mathematics, University of Electro-Communications, Chofu-shi, Tokyo, 1991.
21. Valiant L.G. The complexity of computing the permanent. Theoret. Comput. Sci. 8:1979;189-201.
22. Valiant L.G. Why is boolean complexity theory difficult? Paterson M.S. Boolean Function Complexity. Mathematical Society Lecture Notes Series. Vol. 169:1992;Cambridge University Press, London.
23. 3,3 -free graphs and related problems Inform. Comput. 80(2):1989;152-164.
24. V. Vinay, Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits, in: Proceedings of Sixth Structure in Complexity Theory Conference, 1991, pp. 270-284.
25. J. Vondrák, Implementation and testing of a new algorithm for the Max-Cut problem, Master's Thesis, Charles University, Prague, 1999.