Pages that link to "Item:Q2492639"
From MaRDI portal
The following pages link to Exact sampling from perfect matchings of dense regular bipartite graphs (Q2492639):
Displaying 14 items.
- An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs (Q620956) (← links)
- Yard crane scheduling for container storage, retrieval, and relocation (Q724093) (← links)
- Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs (Q820917) (← links)
- On coupling and the approximation of the permanent (Q1115170) (← links)
- On the random generation and counting of matchings in dense graphs (Q1129018) (← links)
- Approximating the permanent of graphs with large factors (Q1199692) (← links)
- Permanental generating functions and sequential importance sampling (Q2020025) (← links)
- Scaling matrices and counting the perfect matchings in graphs (Q2064289) (← links)
- Solution counting algorithms for constraint-centered search heuristics (Q2272161) (← links)
- Perfect matchings via uniform sampling in regular bipartite graphs (Q2930303) (← links)
- A Bernoulli mean estimate with known relative error distribution (Q2977564) (← links)
- Solution Counting Algorithms for Constraint-Centered Search Heuristics (Q3523086) (← links)
- A perfect sampling method for exponential family random graph models (Q5033313) (← links)
- Sequential importance sampling for estimating expectations over the space of perfect matchings (Q6103989) (← links)