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
Optimal movement of mobile sensors for barrier coverage of a planar region
Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
Reliable assignments of processors to tasks and factoring on matroids
Polynomial time algorithms for variants of graph matching on partial $k$-trees
Characterization of generic properties of linear structured systems for efficient computations.
Constrained target controllability of complex networks
Sweep synchronization as a global propagation mechanism
Efficient dual simplex algorithms for the assignment problem
On the fixed controllable subspace in linear structured systems
On testing monomials in multivariate polynomials
Tiling with Squares and Packing Dominos in Polynomial Time
Crown reductions for the minimum weighted vertex cover problem
Concerning the achromatic number of graphs
Solving the car sequencing problem via branch \& bound
A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
Communication and energy efficient routing protocols for single-hop radio networks
A new framework for hierarchical drawings
Algorithms for dense graphs and networks on the random access computer
An O$(n^{1.75})$ algorithm for $L(2,1)$-labeling of trees
Network flow and 2-satisfiability
A polynomial case of the parsimony haplotyping problem
Balanced optimization problems
The generalized popular condensation problem
Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem
Small maximal matchings in random graphs.
Optimizing restriction site placement for synthetic genomes
On protein structure alignment under distance constraint
A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
School choice: Nash implementation of stable matchings through rank-priority mechanisms
Scalar aggregation in inconsistent databases.
The class cover problem with boxes
Approximating largest convex hulls for imprecise points
Lattice path matroids: structural properties
Bi-criteria and approximation algorithms for restricted matchings
On generalized matching problems
On distance constrained labeling of disk graphs
Ridesharing for emergency evacuation
Weighted popular matchings
On the computational complexity of qualitative coalitional games
Distance three labelings of trees
Approximating the tree and tour covers of a graph
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
Approximating the permanent via importance sampling with application to the dimer covering problem
The directed Hausdorff distance between imprecise point sets
Interval incidence coloring of bipartite graphs
On the Grundy and $b$-chromatic numbers of a graph

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)