Publication:4251057
From MaRDI portal
zbMath0927.05075MaRDI QIDQ4251057
Publication date: 17 June 1999
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Parallel approximation algorithms for maximum weighted matching in general graphs, Linear-Time Approximation for Maximum Weight Matching, A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching, Modularity and greed in double auctions, Adaptive AMG with coarsening based on compatible weighted matching, The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs, Solving maximum weighted matching on large graphs with deep reinforcement learning, Weighted matching in the semi-streaming model, Automatic coarsening in algebraic multigrid utilizing quality measures for matching-based aggregations, Deep Haar scattering networks, Multi-agent reinforcement learning for decentralized stable matching, Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems, A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs, Parallel Aggregation Based on Compatible Weighted Matching for AMG, Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists, Near Approximation of Maximum Weight Matching through Efficient Weight Reduction, Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem, Unnamed Item, Linear time algorithms for generalized edge dominating set problems, A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2, A simple approximation algorithm for the weighted matching problem, A \(2/3\)-approximation algorithm for vertex-weighted matching, Efficient Matching for Column Intersection Graphs, Approximation algorithms in combinatorial scientific computing, Efficient Approximation Algorithms for Weighted $b$-Matching
