scientific article; zbMATH DE number 7651215
From MaRDI portal
Publication:5874548
DOI10.4230/LIPIcs.ESA.2020.76MaRDI QIDQ5874548
Publication date: 7 February 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Unnamed Item
- Push-relabel based algorithms for the maximum transversal problem
- Greedy matching: guarantees and limitations
- Matchings in random regular bipartite digraphs
- Dynamic generation of discrete random variates
- Concerning nonnegative matrices and doubly stochastic matrices
- A fast algorithm for matrix balancing
- Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs
- On randomk-out subgraphs of large graphs
- The university of Florida sparse matrix collection
- Design, implementation, and analysis of maximum transversal algorithms
- TWO THEOREMS IN GRAPH THEORY
- Fully Dynamic Matching in Bipartite Graphs
- The Sinkhorn–Knopp Algorithm: Convergence and Applications
- A new approach to the maximum-flow problem
- Average Case Analysis of a Heuristic for the Assignment Problem
- Computing the block triangular form of a sparse matrix
- Maintaining discrete probability distributions optimally
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
- Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time
- Karp-Sipser based kernels for bipartite graph matching
- Round compression for parallel matching algorithms
- Approximation algorithms in combinatorial scientific computing
- Heuristic initialization for bipartite matching problems
- Power balance and apportionment algorithms for the United States Congress
- Probability and Computing
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication:
