Author:
Pothen Alex,Ferdous S. M.,Manne Fredrik
Abstract
We survey recent work on approximation algorithms for computing degree-constrained subgraphs in graphs and their applications in combinatorial scientific computing. The problems we consider include maximization versions of cardinality matching, edge-weighted matching, vertex-weighted matching and edge-weighted $b$-matching, and minimization versions of weighted edge cover and $b$-edge cover. Exact algorithms for these problems are impractical for massive graphs with several millions of edges. For each problem we discuss theoretical foundations, the design of several linear or near-linear time approximation algorithms, their implementations on serial and parallel computers, and applications. Our focus is on practical algorithms that yield good performance on modern computer architectures with multiple threads and interconnected processors. We also include information about the software available for these problems.
Publisher
Cambridge University Press (CUP)
Subject
General Mathematics,Numerical Analysis
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. cuAlign: Scalable Network Alignment on GPU Accelerators;Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis;2023-11-12
2. A Multi-GPU Aggregation-Based AMG Preconditioner for Iterative Linear Solvers;IEEE Transactions on Parallel and Distributed Systems;2023-08
3. AMG Preconditioners based on Parallel Hybrid Coarsening and Multi-objective Graph Matching;2023 31st Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP);2023-03
4. An Approximate Carry Disregard Multiplier with Improved Mean Relative Error Distance and Probability of Correctness;2022 25th Euromicro Conference on Digital System Design (DSD);2022-08
5. A 2/3-approximation algorithm for vertex-weighted matching;Discrete Applied Mathematics;2022-02