The following pages link to (Q4474103):
Displaying 15 items.
- A fast algorithm to construct a representation for transversal matroids (Q263073) (← links)
- Optimum matchings in weighted bipartite graphs (Q265439) (← links)
- Enumerating perfect matchings in \(n\)-cubes (Q382880) (← links)
- Finding all maximally-matchable edges in a bipartite graph (Q418005) (← links)
- Unranking of small combinations from large sets (Q473209) (← links)
- Approximation algorithms for the interval constrained coloring problem (Q639285) (← links)
- The stable marriage problem with master preference lists (Q1005239) (← links)
- Counting Hamiltonian cycles in bipartite graphs (Q2871195) (← links)
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (Q3419712) (← links)
- Approximating the Interval Constrained Coloring Problem (Q3512460) (← links)
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties (Q4631095) (← links)
- The structural index of sensitivity equation systems (Q5861069) (← links)
- Compression with wildcards: all exact or all minimal hitting sets (Q6083242) (← links)
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes (Q6145807) (← links)
- Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching (Q6199741) (← links)
