An n^{5/2} Algorithm for Maximum Matchings in Bipartite Graphs

Cited in

(only showing first 100 items - show all)

Another disjoint compression algorithm for odd cycle transversal
On some algorithmic investigations of star partitions of graphs
Authentication codes and bipartite graphs
Covering directed graphs by in-trees
Noisy colored point set matching
An efficient distributed algorithm for maximum matching in general graphs
Algorithms for unipolar and generalized split graphs
A survey of direct methods for sparse linear systems
A combinatorial study of the rigidity of planar structures
A simple existence criterion for $(g<f)$-factors
Computing simple circuits from a set of line segments
The complexity of computing metric distances between partitions
Approximate string matching with stuck address bits
On completing latin squares
Recursive structure of S-matrices and an $O(m^ 2)$ algorithm for recognizing sign solvability
Bottleneck partial-matching Voronoi diagrams and applications
Approximating edge dominating set in dense graphs
Using relations to develop a Haskell program for computing maximum bipartite matchings
Making sparse matrices sparser: Computational results
Generalised arc consistency for the AllDifferent constraint: an empirical survey
Solution methods and computational investigations for the linear bottleneck assignment problem
Maximum bipartite flow in networks with adaptive channel width
The extended global cardinality constraint: an empirical survey
On the complexity of graph tree partition problems.
Matchings in colored bipartite networks
A self-stabilizing $\frac23$-approximation algorithm for the maximum matching problem
Iterative improvement of vertex covers
Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
Graphs vertex-partitionable into strong cliques
Graph-theoretical approach to qualitative solvability of linear systems
Jump number of dags having Dilworth number 2
A polynomial-time algorithm for computing the resilience of arrangements of ray sensors
Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
On strongly connected digraphs with bounded cycle length
An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
Solving subgraph isomorphism problems with constraint programming
On Some Problems in the Design of Plane Skeletal Structures
Distributed scheduling for disconnected cooperation
Parallel algorithms for bipartite matching problems on distributed memory computers
The Simple Reachability Problem in Switch Graphs
Cliques in hyperbolic random graphs
Enhancing multi-document summarization using concepts
Using euler partitions to edge color bipartite multigraphs
A remark on the time complexity of the subtree problem
Sensitivity analysis of linear systems—a structural approach
Throughput analysis in wireless networks with multiple users and multiple channels
On the complexity of graph reconstruction
GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY
A perfect matching algorithm for sparse bipartite graphs
Level scheduling under limited resequencing flexibility
On complexity of special maximum matchings constructing
Counting houses of Pareto optimal matchings in the house allocation problem
Quantum algorithms for matching problems
Structural control of single-input rank one bilinear systems
Local computation algorithms for graphs of non-constant degrees
Iterated local search with Trellis-neighborhood for the partial Latin square extension problem
An approximation of the minimum vertex cover in a graph
Packings by Complete Bipartite Graphs
Stable matchings with covering constraints: a complete computational trichotomy
Solving linear programs from sign patterns
AllDifferent-based filtering for subgraph isomorphism
The complexity of testing whether a graph is a superconcentrator
Bounded Unpopularity Matchings
Domino tilings and related models: Space of configurations of domains with holes
Finding all the perfect matchings in bipartite graphs
Depth-first search and the vertex cover problem
The complexity of computing the permanent
Maximum matching of given weight in complete and complete bipartite graphs
Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
Finding all maximally-matchable edges in a bipartite graph
A survey on labeling graphs with a condition at distance two
Fair matchings and related problems
Periodic assignment and graph colouring
Selected topics on assignment problems
A simpler linear time $ \frac{2}{3} - \varepsilon$ approximation for maximum weight matching
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
On vertex independence number of uniform hypergraphs
A polynomial algorithm for the extendability problem in bipartite graphs
A scaling algorithm for maximum weight matching in bipartite graphs
Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem
Distinguishing and classifying from $n$-ary properties
Iterative compression and exact algorithms
Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
The discrete time-cost tradeoff problem revisited
On the Grundy number of a graph
Forests, frames, and games: Algorithms for matroid sums and applications
A fixed-parameter tractable algorithm for matrix domination
On global warming: Flow-based soft global constraints
Toughness, hamiltonicity and split graphs
A theory of alternating paths and blossoms for proving correctness of the $O(\sqrt{V}E)$ general graph maximum matching algorithm
New scaling algorithms for the assignment and minimum mean cycle problems
Fixed-parameter algorithms for scaffold filling
Complexity of learning in concept lattices from positive and negative examples
Network alignment by discrete Ollivier-Ricci flow
On the asymptotic optimality of an algorithm for solving the maximum $m$-PSP in a multidimensional Euclidean space
Approximating matchings in parallel
Scaling algorithms for network problems
The translation square map and approximate congruence
A parameterized perspective on packing paths of length two
The general maximum matching algorithm of Micali and Vazirani

This page was built for publication: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5682014)