Pages that link to "Item:Q4091992"
From MaRDI portal
The following pages link to An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs (Q4091992):
Displayed 50 items.
- Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
- Complexity results for storage loading problems with stacking constraints (Q321101) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- A two-stage hardware scheduler combining greedy and optimal scheduling (Q436901) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- Greedy matching: guarantees and limitations (Q513303) (← links)
- 1-Approximation algorithm for bottleneck disjoint path matching (Q672495) (← links)
- Attribute value reordering for efficient hybrid OLAP (Q855692) (← links)
- Incremental assignment problem (Q865928) (← links)
- A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
- An efficient distributed algorithm for maximum matching in general graphs (Q911306) (← links)
- The labeled maximum matching problem (Q1000970) (← links)
- Stacks in canonical RNA pseudoknot structures (Q1025221) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- An augmenting path algorithm for linear matroid parity (Q1087880) (← links)
- The general maximum matching algorithm of Micali and Vazirani (Q1105385) (← links)
- A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective (Q1133463) (← links)
- F-factors of graphs: A generalized matching problem (Q1135864) (← links)
- On generalized matching problems (Q1149783) (← links)
- Algorithmic proofs of two relations between connectivity and the 1- factors of a graph (Q1153100) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs (Q1234553) (← links)
- Searching for a strong double tracing in a graph (Q1265251) (← links)
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm (Q1323480) (← links)
- Approximation algorithms for maximum dispersion (Q1375119) (← links)
- Constraint programming approach for school timetabling. (Q1422351) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- Approximate minimum weight matching on points in k-dimensional space (Q1825658) (← links)
- Minimal length test vectors for multiple-fault detection (Q1826631) (← links)
- Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers (Q2149100) (← links)
- Two dimensional maximum weight matching using Manhattan topology (Q2157895) (← links)
- Improved approximations for capacitated vehicle routing with unsplittable client demands (Q2164702) (← links)
- Reinforcement learning for optimal error correction of toric codes (Q2213126) (← links)
- Computing maximum non-crossing matching in convex bipartite graphs (Q2348053) (← links)
- A complexity and approximation framework for the maximization scaffolding problem (Q2354768) (← links)
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363) (← links)
- Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091) (← links)
- Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs (Q2813347) (← links)
- Dynamic matchings and quasidynamic fractional matchings. I (Q3040950) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- Worst-case greedy matchings in the unitd-cube (Q3204344) (← links)
- Improved Approximation Algorithms for Weighted 2-Path Partitions (Q3452854) (← links)
- Strict matching matroids and matroid algorithms (Q3744174) (← links)
- Optimum matching forests I: Special weights (Q3922478) (← links)
- Scheduling jobs to two machines subject to batch arrival ordering (Q3960455) (← links)
- Probabilistic analysis of divide‐and‐conquer heuristics for minimum weighted euclidean matching (Q3969884) (← links)
- Maximum matching of given weight in complete and complete bipartite graphs (Q4206784) (← links)
- Deep Haar scattering networks (Q4603720) (← links)
- ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH (Q4963120) (← links)