Efficient algorithms for finding maximum matching in graphs
From MaRDI portal
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)
Recommendations
Cited in
(69)- Stabilizing maximum matching in bipartite networks
- Minimum-maximal matching in series-parallel graphs
- Efficient labelling algorithms for the maximum noncrossing matching problem
- Persistency in maximum cardinality bipartite matchings
- From Hall's matching theorem to optimal routing on hypercubes
- Graph-theoretic multisample tests of equality in distribution for high dimensional data
- Trapezoidal matrices and the bottleneck assignment problem
- A flexible formal framework for masking/demasking faults
- Finding a maximum matching in a permutation graph
- A 3/2-approximation for big two-bar charts packing
- On the induced matching problem in Hamiltonian bipartite graphs
- Erratum to: ``Two dimensional maximum weight matching using Manhattan topology
- Simplified group activity selection with group size constraints
- Matching and scheduling of student-company-talks for a university it-speed dating event
- Tree-based cryptographic access control
- Faster algorithm for finding maximum 1-restricted simple 2-matchings
- Minimum cost stability in exchange networks
- An efficient construction of one-to-many node-disjoint paths in folded hypercubes
- Ontology-based concept similarity in formal concept analysis
- The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching
- Parallel approximation algorithms for maximum weighted matching in general graphs
- A Fast Perfect-Matching Algorithm in Random Graphs
- The blossom algorithm of maximum \(b\)-matching
- scientific article; zbMATH DE number 4155887 (Why is no real title available?)
- scientific article; zbMATH DE number 4158661 (Why is no real title available?)
- Angle Optimization in Target Tracking
- On the efficiency of Egerváry's perfect matching algorithm
- scientific article; zbMATH DE number 3900543 (Why is no real title available?)
- An O(EV\log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs
- scientific article; zbMATH DE number 177842 (Why is no real title available?)
- A two-stage hardware scheduler combining greedy and optimal scheduling
- scientific article; zbMATH DE number 1151367 (Why is no real title available?)
- scientific article; zbMATH DE number 1962833 (Why is no real title available?)
- scientific article; zbMATH DE number 1759463 (Why is no real title available?)
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs
- The weighted matching approach to maximum cardinality matching
- A 2/3-approximation algorithm for vertex weighted matching in bipartite graphs
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗
- Research on matrix algorithm of the greatest matching of the simple graph
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
- Minimum weight euclidean matching and weighted relative neighborhood graphs
- Graph reduction with spectral and cut guarantees
- Parallel maximum matching algorithms in interval graphs
- All separating triangles in a plane graph can be optimally ``broken in polynomial time
- scientific article; zbMATH DE number 279491 (Why is no real title available?)
- An Exact Distribution-Free Test Comparing Two Multivariate Distributions based on Adjacency
- Efficient algorithms for maximum weight matchings in general graphs with small edge weights
- Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model
- Partial ML estimation for spatial autoregressive nonlinear probit models with autoregressive disturbances
- The difficulty of beating the Taxman
- Heuristic sequencing methods for time optimal tracking of nested, open and closed paths
- Gene order phylogeny via ancestral genome reconstruction under Dollo
- New approximation results on graph matching and related problems
- A graph-theoretic barcode ordering model for linked-reads
- On the complexity of core, kernel, and bargaining set
- FLEX: a fast and light-weight learned index for \(k\)NN search in high-dimensional space
- A new class of lower bounds for scheduling a batch processing machine to minimize makespan
- On the complexity of destructive bribery in approval-based multiwinner voting
- The number of maximal matchings in polygon rings
- Maximum-expectation matching under recourse
- Better approximation algorithms for clustered TSP and subgroup planning
- Multilinearization of polynomial models by linear state transformation
- Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
- Quantum algorithms for matching problems
- Incremental assignment problem
- On the construction of all shortest node-disjoint paths in star networks
- Parameterized lower bound and inapproximability of polylogarithmic string barcoding
- The maximum fuzzy weighted matching models and hybrid genetic algorithm
- Error-free milestones in error prone measurements
This page was built for publication: Efficient algorithms for finding maximum matching in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745302)
