scientific article; zbMATH DE number 7651215
From MaRDI portal
Publication:5874548
DOI10.4230/LIPICS.ESA.2020.76MaRDI QIDQ5874548FDOQ5874548
Authors: Ioannis Panagiotas, Bora Uçar 
Publication date: 7 February 2023
Title of this publication is not available (Why is that?)
Cites Work
- The University of Florida sparse matrix collection
- Dynamic generation of discrete random variates
- Concerning nonnegative matrices and doubly stochastic matrices
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- A new approach to the maximum-flow problem
- TWO THEOREMS IN GRAPH THEORY
- Probability and Computing
- The Sinkhorn–Knopp Algorithm: Convergence and Applications
- Computing the block triangular form of a sparse matrix
- Heuristic initialization for bipartite matching problems
- Maintaining discrete probability distributions optimally
- Push-relabel based algorithms for the maximum transversal problem
- Title not available (Why is that?)
- Greedy matching: guarantees and limitations
- Power balance and apportionment algorithms for the United States Congress
- A fast algorithm for matrix balancing
- Matchings in random regular bipartite digraphs
- Average Case Analysis of a Heuristic for the Assignment Problem
- Perfect matchings in \(O(n\log n)\) time in regular bipartite graphs
- Fully dynamic matching in bipartite graphs
- Approximation algorithms in combinatorial scientific computing
- Round compression for parallel matching algorithms
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
- Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time
- On random \(k\)-out subgraphs of large graphs
- Design, implementation, and analysis of maximum transversal algorithms
- Karp-Sipser based kernels for bipartite graph matching
Cited In (3)
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874548)
