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

Cited in

(only showing first 100 items - show all)

On graphs whose eternal vertex cover number and vertex cover number coincide
Colinear Coloring on Graphs
On testing monomials in multivariate polynomials
Optimum distance flag codes from spreads via perfect matchings in graphs
Linear programming in the semi-streaming model with application to the maximum matching problem
DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
A faster algorithm for cuckoo insertion and bipartite matching in large graphs
The generalized popular condensation problem
Approximately counting and sampling knowledge states
Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
Bell's Primeness Criterion for W(2n + 1)
Measurable equidecompositions for group actions with an expansion property
Linear time approximation algorithms for~degree~constrained subgraph problems
Depth First Search in the Semi-streaming Model
Concerning the achromatic number of graphs
scientific article; zbMATH DE number 7561531 (Why is no real title available?)
Min-Cost Flow in Unit-Capacity Planar Graphs
Distance three labelings of trees
Algorithms and bounds for drawing directed graphs
A marriage matching mechanism menagerie
scientific article; zbMATH DE number 7559248 (Why is no real title available?)
A fast algorithm to construct a representation for transversal matroids
Optimum matchings in weighted bipartite graphs
Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings
Complexities of efficient solutions of rectilinear polygon cover problems
Feedback control for structured descriptor systems with minimum free-entry pattern gain vectors
Linear-time parameterized algorithms with limited local resources
Maximum tree-packing in time $O(n^{5/2})$
A survey of direct methods for sparse linear systems
Throughput analysis in wireless networks with multiple users and multiple channels
A (2 + ) k-vertex kernel for the dual coloring problem
Recursive structure of S-matrices and an O(m^ 2) algorithm for recognizing sign solvability
Closing complexity gaps for coloring problems on $H$-free graphs
Planar 3-SAT with a clause/variable cycle
Probabilistic quality estimations for combinatorial optimization problems
Optimal Partial Tiling of Manhattan Polyominoes
The directed Hausdorff distance between imprecise point sets
A polynomial case of the parsimony haplotyping problem
Approximating the permanent via importance sampling with application to the dimer covering problem
Bribery and control in stable marriage
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
Matchability and $k$-maximal matchings
Concurrent operations can be parallelized in scheduling multiprocessor job shop
Finding all maximally-matchable edges in a bipartite graph
The complexity of computing the permanent
The recoverability of network controllability with respect to node additions
An efficient distributed algorithm for maximum matching in general graphs
On the maximum edge-pair embedding bipartite matching
A fixed-parameter algorithm for the vertex cover $P_3$ problem
The exchange-stable marriage problem
Fixed-parameter tractability of $(n-k)$ list coloring
A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem
Constrained target controllability of complex networks
Level scheduling under limited resequencing flexibility
Optimization-based approaches for maximizing aggregate recommendation diversity
Path factors and parallel knock-out schemes of almost claw-free graphs
Data Reduction for Maximum Matching on Real-World Graphs
The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
Non-cancellative Boolean circuits: a generalization of monotone Boolean circuits
Approximating Largest Convex Hulls for Imprecise Points
Fair matchings and related problems
A new framework for hierarchical drawings
Tiling with Squares and Packing Dominos in Polynomial Time
Recomputing causality assignments on lumped process models when adding new simplification assumptions
Jump number of two-directional orthogonal ray graphs
Strong structural input and state observability of linear time-invariant systems: graphical conditions and algorithms
Maximum bipartite flow in networks with adaptive channel width
The extended global cardinality constraint: an empirical survey
Using euler partitions to edge color bipartite multigraphs
Bipartite matching in the semi-streaming model
An approximation algorithm for diversity-aware fair $k$-supplier problem
Crown reductions for the minimum weighted vertex cover problem
Distributed backup placement in networks
Constraint programming and operations research
Orthogonal layout with optimal face complexity
Efficient bounds for the stable set, vertex cover and set packing problems
On a scheduling problem where a job can be executed only by a limited number of processors
Masking traveling beams: optical solutions for NP-complete problems, trading space for time
Lattice path matroids: structural properties
Packing paths: recycling saves time
Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication
A parameterized algorithmics framework for degree sequence completion problems in directed graphs
Parameterized algorithms and kernels for rainbow matching
On extensions of the deterministic online model for bipartite matching and max-sat
Selected topics on assignment problems
Maximum matchings and trees
Representing triangulated graphs in stars
A General Testability Theory
Optimizing restriction site placement for synthetic genomes
Bottleneck partial-matching Voronoi diagrams and applications
Block-based minimum input design for the structural controllability of complex networks
Dynamic DFS in undirected graphs: breaking the $O(m)$ barrier
Packings by Complete Bipartite Graphs
Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs
Computing a maximum cardinality matching in a bipartite graph in time $O(n^{1,5}\sqrt{m/\log \,n})$

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)