A combinatorial algorithm for Pfaffians

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1627, Issue , 1999, Pages 134-143

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

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; GRAPHIC METHODS; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION;

COMBINATORIAL ALGORITHM; COMPLEXITY CLASS; ENCODINGS; FAST ALGORITHMS; PERFECT MATCHINGS; PFAFFIAN; PLANAR GRAPH; POLYNOMIAL-TIME;

COMBINATORIAL MATHEMATICS;

EID: 84957806105     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48686-0_13     Document Type: Conference Paper

References (13)

1. AlRe98. E. Allender and K. Reinhardt, Isolation, Matching, and Counting, in IEEE Conference on Computational Complexity, pp 92-100, 1998.
2. Kas67. P. W. Kasteleyn, Graph Theory and Crystal Physics, in Graph Theory and Theoretical Physics, ed: F. Harary, Academic Press, pp 43-110, 1967.
3. Lit74. C. H. C. Little, An extension of Kasteleyn's method of enumerating the 1-factors of planar graphs, in Combinatorial Mathematics, Proc. 2nd Australian Conference, ed: D. Holton, Lecture Notes in Mathematics, 403, pp 63-72, 1974.
4. LovPlu86. L. Lovasz and M. Plummer, Matching Theory, Annals of Discrete Mathematics 29, North-Holland, 1986.
5. Lyn77. N. Lynch, Log Space Recognition and Translation of Parenthesis Languages, Journal of the ACM, Vol. 24(4), pp 583-590, 1977.
6. MV97. M. Mahajan and V. Vinay, Determinants: Combinatorics, algorithms, and complexity, Chicago Journal of Theoretical Computer Science, vol. 5, 1997.
7. MRST97. W. McCuaig, N. Robertson, P. D. Seymour and R. Thomas, Permanents, Pfaffian Orientations, and Even Directed Circuits, Proc. of IEEE Symposium on Theory of Computing, pp 402-405, 1997.
8. MVV87. K. Mulmuley, U. V. Vazirani and V. V. Vazirani, Matching is as easy as Matrix Inversion, Combinatorica, vol. 7, pp 105-113, 1987.
9. Reif84. J. Reif, Symmetric Complementation, Journal of the ACM, vol. 31(2), pp 401-421, 1984.
10. Val79. L. G. Valiant, The complexity of computing the permanent, Theoretical Computer Science, vol. 8, pp 189-201, 1979.
11. Vaz89. V. V. Vazirani, NC algorithms for computing the number of perfect matchings in K3;3-free graphs and related problems, Information and Computation, vol. 80(2), pp 152-164, 1989.
12. VY89. V. V. Vazirani and M. Yannakakis, Pfaffian Orientations, 0-1 permanents and even cycles in directed graphs, Discrete Applied Mathematics, vol. 25, pp 179-190, 1989.
13. Vin91. V. Vinay, Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits, Proc. 6th IEEE Structure in Complexity Theory Conference, pp 270-284, 1991.