Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Micha Sharir Tel Aviv University , Tel Aviv, Israel
Adam Sheffer Tel Aviv University , Tel Aviv, Israel
Emo Welzl ETH Zürich, Zurich, Switzerland
Published in:
Cover Image
 
· Proceeding
SoCG '12 Proceedings of the 2012 symposuim on Computational Geometry
Pages 189-198
ACM New York, NY, USA ©2012
table of contents ISBN: 978-1-4503-1299-8 doi>10.1145/2261250.2261277
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique Published by ACM 2012 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 46
· Downloads (cumulative): 46
· Citation Count: 1


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder