多层和时态图的聚类编辑

IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondřej Suchý
{"title":"多层和时态图的聚类编辑","authors":"Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondřej Suchý","doi":"10.1007/s00224-024-10174-y","DOIUrl":null,"url":null,"abstract":"<p>Motivated by the recent rapid growth of research for algorithms to cluster multi-layer and temporal graphs, we study extensions of the classical <span>Cluster Editing</span> problem. In <span>Multi-Layer Cluster Editing</span> we receive a set of graphs on the same vertex set, called <i>layers</i> and aim to transform all layers into cluster graphs (disjoint unions of cliques) that differ only slightly. More specifically, we want to mark at most <i>d</i> vertices and to transform each layer into a cluster graph using at most <i>k</i> edge additions or deletions per layer so that, if we remove the marked vertices, we obtain the same cluster graph in all layers. In <span>Temporal Cluster Editing</span> we receive a <i>sequence</i> of layers and we want to transform each layer into a cluster graph so that consecutive layers differ only slightly. That is, we want to transform each layer into a cluster graph with at most <i>k</i> edge additions or deletions and to mark a distinct set of <i>d</i> vertices in each layer so that each two consecutive layers are the same after removing the vertices marked in the first of the two layers. We study the combinatorial structure of the two problems via their parameterized complexity with respect to the parameters <i>d</i> and <i>k</i>, among others. Despite the similar definition, the two problems behave quite differently: In particular, <span>Multi-Layer Cluster Editing</span> is fixed-parameter tractable with running time <span>\\(k^{O(k + d)} s^{O(1)}\\)</span> for inputs of size <i>s</i>, whereas <span>Temporal Cluster Editing</span> is <span>\\(\\textsf {W[1]}\\)</span>-hard with respect to <i>k</i> even if <span>\\(d = 3\\)</span>.</p>","PeriodicalId":22832,"journal":{"name":"Theory of Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cluster Editing for Multi-Layer and Temporal Graphs\",\"authors\":\"Jiehua Chen, Hendrik Molter, Manuel Sorge, Ondřej Suchý\",\"doi\":\"10.1007/s00224-024-10174-y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Motivated by the recent rapid growth of research for algorithms to cluster multi-layer and temporal graphs, we study extensions of the classical <span>Cluster Editing</span> problem. In <span>Multi-Layer Cluster Editing</span> we receive a set of graphs on the same vertex set, called <i>layers</i> and aim to transform all layers into cluster graphs (disjoint unions of cliques) that differ only slightly. More specifically, we want to mark at most <i>d</i> vertices and to transform each layer into a cluster graph using at most <i>k</i> edge additions or deletions per layer so that, if we remove the marked vertices, we obtain the same cluster graph in all layers. In <span>Temporal Cluster Editing</span> we receive a <i>sequence</i> of layers and we want to transform each layer into a cluster graph so that consecutive layers differ only slightly. That is, we want to transform each layer into a cluster graph with at most <i>k</i> edge additions or deletions and to mark a distinct set of <i>d</i> vertices in each layer so that each two consecutive layers are the same after removing the vertices marked in the first of the two layers. We study the combinatorial structure of the two problems via their parameterized complexity with respect to the parameters <i>d</i> and <i>k</i>, among others. Despite the similar definition, the two problems behave quite differently: In particular, <span>Multi-Layer Cluster Editing</span> is fixed-parameter tractable with running time <span>\\\\(k^{O(k + d)} s^{O(1)}\\\\)</span> for inputs of size <i>s</i>, whereas <span>Temporal Cluster Editing</span> is <span>\\\\(\\\\textsf {W[1]}\\\\)</span>-hard with respect to <i>k</i> even if <span>\\\\(d = 3\\\\)</span>.</p>\",\"PeriodicalId\":22832,\"journal\":{\"name\":\"Theory of Computing Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theory of Computing Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s00224-024-10174-y\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theory of Computing Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00224-024-10174-y","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

最近,对多层图和时序图聚类算法的研究迅速发展,受此激励,我们研究了经典聚类编辑问题的扩展。在多层聚类编辑中,我们会收到一组相同顶点集上的图,称为层,目的是将所有层转化为仅有细微差别的聚类图(小群的不相交联盟)。更具体地说,我们希望最多标记 d 个顶点,并使用每层最多 k 条边的增减将每层转化为聚类图,这样,如果我们移除标记的顶点,就能在所有层中得到相同的聚类图。在 "时间聚类编辑 "中,我们会收到一连串的图层,我们希望将每一层转化为聚类图,这样连续的图层之间只有细微的差别。也就是说,我们希望将每一层转化为最多有 k 条边增删的簇图,并在每一层中标记一组不同的 d 个顶点,这样在去除第一层中标记的顶点后,每两个连续的层都是相同的。我们通过参数 d 和 k 等参数的参数化复杂度来研究这两个问题的组合结构。尽管定义相似,这两个问题的表现却大相径庭:特别是,对于大小为 s 的输入,多层集群编辑是固定参数可处理的,其运行时间为 \(k^{O(k + d)} s^{O(1)}\) ,而时态集群编辑即使在 \(d = 3\) 的情况下,相对于 k 也是\(\textsf {W[1]}\)困难的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Cluster Editing for Multi-Layer and Temporal Graphs

Cluster Editing for Multi-Layer and Temporal Graphs

Motivated by the recent rapid growth of research for algorithms to cluster multi-layer and temporal graphs, we study extensions of the classical Cluster Editing problem. In Multi-Layer Cluster Editing we receive a set of graphs on the same vertex set, called layers and aim to transform all layers into cluster graphs (disjoint unions of cliques) that differ only slightly. More specifically, we want to mark at most d vertices and to transform each layer into a cluster graph using at most k edge additions or deletions per layer so that, if we remove the marked vertices, we obtain the same cluster graph in all layers. In Temporal Cluster Editing we receive a sequence of layers and we want to transform each layer into a cluster graph so that consecutive layers differ only slightly. That is, we want to transform each layer into a cluster graph with at most k edge additions or deletions and to mark a distinct set of d vertices in each layer so that each two consecutive layers are the same after removing the vertices marked in the first of the two layers. We study the combinatorial structure of the two problems via their parameterized complexity with respect to the parameters d and k, among others. Despite the similar definition, the two problems behave quite differently: In particular, Multi-Layer Cluster Editing is fixed-parameter tractable with running time \(k^{O(k + d)} s^{O(1)}\) for inputs of size s, whereas Temporal Cluster Editing is \(\textsf {W[1]}\)-hard with respect to k even if \(d = 3\).

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Theory of Computing Systems
Theory of Computing Systems 工程技术-计算机:理论方法
CiteScore
1.90
自引率
0.00%
发文量
36
审稿时长
6-12 weeks
期刊介绍: TOCS is devoted to publishing original research from all areas of theoretical computer science, ranging from foundational areas such as computational complexity, to fundamental areas such as algorithms and data structures, to focused areas such as parallel and distributed algorithms and architectures.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信