Pages that link to "Item:Q1129018"
From MaRDI portal
The following pages link to On the random generation and counting of matchings in dense graphs (Q1129018):
Displaying 9 items.
- Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs (Q820917) (← links)
- Permanental generating functions and sequential importance sampling (Q2020025) (← links)
- Scaling matrices and counting the perfect matchings in graphs (Q2064289) (← links)
- Random bichromatic matchings (Q2482731) (← links)
- A Glimpse at Paul G. Spirakis (Q3464465) (← links)
- Some upper bounds for permanents of (0, 1)-matrices (Q3511473) (← links)
- Approximate counting via random optimization (Q4358435) (← links)
- (Q4687761) (← links)
- The distance approach to approximate combinatorial counting (Q5956633) (← links)