Pfaffian algorithms for sampling routings on regions with free boundary conditions

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

Volumn 1671, Issue , 1999, Pages 257-268

  Martin, Russell A ^a   Randall, Dana ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; MARKOV PROCESSES; OPTIMIZATION; RANDOM PROCESSES;

COMBINATORIAL PROBLEM; EULERIAN; FAST METHODS; FREE BOUNDARY CONDITIONS; KEY ELEMENTS; LATTICE PATHS; PFAFFIAN; ROUTINGS;

APPROXIMATION ALGORITHMS;

EID: 79960843412     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48413-4_26     Document Type: Conference Paper

References (12)

1. C. J. Colbourn, W. J. Myrvold, and E. Neufeld. Two algorithms for unranking arborescences. J. Algorithms, 20:268-281, 1996.
2. I. M. Gessel and X. G. Viennot. Binomial determinants, paths, and hook length formulae. Advances in Mathematics, 58:300-321, 1985.
3. I. M. Gessel and X. G. Viennot. Determinants, paths, and plane partitions. Preprint, 1989.
4. M. R. Jerrum, L. G. Valiant, and V. V. Vazirani. Random generation of com­binatorial structures from a uniform distribution. Theoretical Computer Science, 43:169-188, 1986.
5. W. Jockusch, J. Propp, and P. Shor. Random domino tilings and the arctic circle theorem. Preprint, 1995.
6. R. Kenyon. Local statistics of dimers on a lattice. Annales de I’Institut Henri Poincare - Probability et Statistigues, 33:591-618, 1997.
7. B. Lindström. On the vector representations of induced matroids. Bulletin of the London Mathematical Society, 5:85-90, 1973.
8. M. Luby, D. Randall, and A. Sinclair. Markov chain algorithms for planar lattice structures. Proc. 36th IEEE Symposium on Foundations of Computer Science, 150-159, 1995.
9. L. McShine and P. Tetali. On the mixing time of the triangulation walk and other Catalan structures. Randomization Methods in Algorithm Design, DJMACS-AMS 43, 1998.
10. J. Sherman and W. J. Morrison. Adjustment of an inverse matrix corresponding to changes in the elements of a given column or a given row of the original matrix. The Annals of Mathematical Statistics 20:621, 1949.
11. J. R. Stembridge. Non-intersecting paths, Pfaffians, and plane partitions. Advances in Mathematics, 83:96-131, 1990.
12. D. B. Wilson. Determinant algorithms for random planar structures. Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 258-267, 1997.