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

Cited in

(only showing first 100 items - show all)

Approximating Largest Convex Hulls for Imprecise Points
Attributed relational graph matching based on the nested assignment structure
Representing triangulated graphs in stars
The exchange-stable marriage problem
Best of two local models: centralized local and distributed local algorithms
Fully dynamic maximal matching in $O(\log n)$ update time (corrected version)
Uniform sampling of $k$-hypertournaments
Two-factors in orientated graphs with forbidden transitions
Variations on instant insanity
A $(2 + \epsilon ) k$-vertex kernel for the dual coloring problem
Edge coloring of bipartite graphs with constraints
A new fast heuristic for labeling points
Lower bounds for Boolean circuits of bounded negation width
Restrictions and preassignments in preemptive open shop scheduling
Efficient simulation of circuits by EREW PRAMs
INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS
On the $k$-orientability of random graphs
Embedding partial Steiner triple systems is NP-complete
Optimum distance flag codes from spreads via perfect matchings in graphs
Iterative Compression and Exact Algorithms
Structural Identifiability in Low-Rank Matrix Factorization
List edge multicoloring in graphs with few cycles
Alternating paths along axis-parallel segments
Distributed backup placement in networks
Mathematical models for stable matching problems with ties and incomplete lists
On gallery watchmen in grids
A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
It is tough to be a plumber
Non-cancellative Boolean circuits: A generalization of monotone boolean circuits
Deadlock-freedom in resource contentions
On size reduction techniques for multitape automata
Multiconsistency and robustness with global constraints
Incremental assignment problem
A $5k$-vertex kernel for $P_2$-packing
Maximum packing for $k$-connected partial $k$-trees in polynomial time
Computing Euclidean bottleneck matchings in higher dimensions
Better approximability results for min-max tree/cycle/path cover problems
Min-Cost Flow in Unit-Capacity Planar Graphs
Probabilistic and exact frequent subtree mining in graphs beyond forests
Path factors and parallel knock-out schemes of almost claw-free graphs
A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs
scientific article; zbMATH DE number 1769330 (Why is no real title available?)
An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
Solving Kirkman's schoolgirl problem in a few seconds
Structural identifiability in low-rank matrix factorization
Computing fair and bottleneck matchings in geometric graphs
Stabilizing maximum matching in bipartite networks
Classes of perfect graphs
On the parametric complexity of schedules to minimize tardy tasks.
The asymmetric median tree. --- A new model for building consensus trees
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
Flow shop scheduling problem with conflict graphs
Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication
Maximizing the number of unused colors in the vertex coloring problem
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
Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
Linear-time approximation for maximum weight matching
Computing a maximum cardinality matching in a bipartite graph in time $O(n^{1,5}\sqrt{m/\log \,n})$
A fixed-parameter algorithm for the vertex cover $P_3$ problem
An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
An algorithm for fractional assignment problems
On the use of the complexity index as a measure of complexity in activity networks
Efficient random graph matching via degree profiles
Perfect matchings in hexagonal systems
The isomorphism problem for classes of graphs closed under contraction

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)