Shared-Memory Parallel Edmonds Blossom Algorithm for Maximum Cardinality Matching in General Graphs

2024 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS, IPDPSW 2024(2024)

引用 0|浏览2
暂无评分
关键词
matching,general graphs,Edmonds Blossom,parallel
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要