Finding heaviest H -subgraphs in real weighted graphs, with applications

Author:

Vassilevska Virginia1,Williams Ryan1,Yuster Raphael2

Affiliation:

1. Carnegie Mellon University, Pittsburgh, PA

2. University of Haifa, Haifa, Israel

Abstract

For a graph G with real weights assigned to the vertices (edges), the MAX H -SUBGRAPH problem is to find an H -subgraph of G with maximum total weight, if one exists. Our main results are new strongly polynomial algorithms for the MAX H -SUBGRAPH problem. Some of our algorithms are based, in part, on fast matrix multiplication. For vertex-weighted graphs with n vertices we solve a more general problem: the all pairs MAX H -SUBGRAPH problem, where the task is to find for every pair of vertices u,v, a maximum H -subgraph containing both u and v , if one exists. We obtain an O ( n t (ω, h )) -time algorithm for the all pairs MAX H -SUBGRAPH problem in the case where H is a fixed graph with h vertices and ω < 2.376 is the exponent of matrix multiplication. The value of t (ω, h ) is determined by solving a small integer program. In particular, heaviest triangles for all pairs can be found in O ( n 2+1/(4-ω) ) ≤ o ( n 2.616 )-time. For h =4,5,8 the running time of our algorithm essentially matches that of the (unweighted) H -subgraph detection problem. Using rectangular matrix multiplication, the value of t ( ω,h ) can be improved; for example, the runtime for triangles becomes O ( n 2.575 ). We also present improved algorithms for the MAX H -SUBGRAPH problem in the edge-weighted case. In particular, we obtain an O ( m 2−1/ k log n )-time algorithm for the heaviest cycle of length 2 k or 2 k −1 in a graph with m edges and an O ( n 3 /log n )-time randomized algorithm for finding the heaviest cycle of any fixed length. Our methods also yield efficient algorithms for several related problems that are faster than any previously existing algorithms. For example, we show how to find chromatic H -subgraphs in edge-colored graphs, and how to compute the most significant bits of the distance product of two real matrices, in truly subcubic time.

Publisher

Association for Computing Machinery (ACM)

Subject

Mathematics (miscellaneous)

Cited by 25 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. On Efficient Large Sparse Matrix Chain Multiplication;Proceedings of the ACM on Management of Data;2024-05-29

2. Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products;International Journal of Foundations of Computer Science;2023-11-10

3. Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Counting Homomorphic Cycles in Degenerate Graphs;ACM Transactions on Algorithms;2023-01-31

5. An evaluation of fast segmented sorting implementations on GPUs;Parallel Computing;2022-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3