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
Output sensitive fault tolerant maximum matching
An improved approximation for maximum $k$-dependent set on bipartite graphs
The envy-free matching problem with pairwise preferences
The $b$-\textsc{Matching} problem in distance-hereditary graphs and beyond
A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
Minimal rationalizations
Allowing cycles in discrete Morse theory
Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
On adaptive algorithms for maximum matching
On the solution bound of two-sided scaffold filling
Optimization-based approaches for maximizing aggregate recommendation diversity
Sublinear graph approximation algorithms
Independent sets and hitting sets of bicolored rectangular families
On $(k+1)$-line graphs of $k$-trees and their nullities
Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
scientific article; zbMATH DE number 7561531 (Why is no real title available?)
Uniform-scale assessment of role minimization in bipartite networks and its application to access control
The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
Choosing $k$ from $m$: feasible elimination procedures reconsidered
Security index based on perfectly undetectable attacks: graph-theoretic conditions
Speeding up Graph Algorithms via Switching Classes
Maximizing the strong triadic closure in split graphs and proper interval graphs
Approximation algorithms in combinatorial scientific computing
On graphs whose eternal vertex cover number and vertex cover number coincide
Maximizing the strong triadic closure in split graphs and proper interval graphs
Chromatic index of dense quasirandom graphs
Planar 3-SAT with a clause/variable cycle
List-coloring -- parameterizing from triviality
On applications of bipartite graph associated with algebraic structures
What Is Known About Vertex Cover Kernelization?
The Power of Linear-Time Data Reduction for Maximum Matching
A local algorithm and its percolation analysis of bipartite z-matching problem
Feedback control for structured descriptor systems with minimum free-entry pattern gain vectors
Linear-time parameterized algorithms with limited local resources
Learning block-preserving graph patterns and its application to data mining
Destroying Bicolored $P_3$s by Deleting Few Edges

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)