arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.06361cs.DScs.CC
收藏

关于稠密公共子图的求法

On Finding Dense Common Subgraphs

Moses Charikar, Yonatan Naamad, Jimmy Wu

摘要:

我们研究了最近引入的问题,找到密集的公共子图:给定一个序列的图,共享相同的顶点集,目标是找到一个子集的顶点$S$,最大化一些聚合措施的密度诱导$S$在每个给定的图的子图。聚合函数的不同选择引起了最近研究的问题的变体。我们解决了许多遗留的问题,以前的作品,显示NP-硬度,硬度的近似,非平凡的近似算法,和一个完整的差距自然放松。

英文摘要:

We study the recently introduced problem of finding dense common subgraphs: Given a sequence of graphs that share the same vertex set, the goal is to find a subset of vertices $S$ that maximizes some aggregate measure of the density of the subgraphs induced by $S$ in each of the given graphs. Different choices for the aggregation function give rise to variants of the problem that were studied recently. We settle many of the questions left open by previous works, showing NP-hardness, hardness of approximation, non-trivial approximation algorithms, and an integrality gap for a natural relaxation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑