Abstract
We introduce techniques for deriving closed form generating functions for enumerating permutations with restricted positions keeping track of various statistics. The method involves evaluating permanents with variables as entries. These are applied to determine the sample size required for a novel sequential importance sampling algorithm for generating random perfect matchings in classes of bipartite graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
