边加权图上桁架维护问题的算法

IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS International Journal of Foundations of Computer Science Pub Date : 2023-08-01 DOI:10.1142/s0129054123460036
Bin Liu, Zhenming Liu, Feiteng Zhang
{"title":"边加权图上桁架维护问题的算法","authors":"Bin Liu, Zhenming Liu, Feiteng Zhang","doi":"10.1142/s0129054123460036","DOIUrl":null,"url":null,"abstract":"The [Formula: see text]-truss was proposed by Jonathan Cohen in 2008, and it is a widely used as index in graph analysis for cohesive subgraph mining. There are two basic problems in this area. One is the truss decomposition problem, which is to compute the truss number of every edge; the other is the truss maintenance problem, which is to update the truss numbers of the affected edges in a dynamic graph while avoiding the truss number recomputation of all edges. However, few results are known on edge-weighted graphs. In this paper, we focus on the truss maintenance problem on edge-weighted graphs. Firstly, we propose a basic algorithm for the truss decomposition problem on edge-weighted graphs. Then we propose two indices, weighted growth potential support (WGPS) and weighted remaining potential support (WRPS), to help find the edges with potential changes on their truss numbers. Finally, we propose algorithms for the truss maintenance problem on edge-weighted graphs.","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algorithms for the Truss Maintenance Problem on Edge-Weighted Graphs\",\"authors\":\"Bin Liu, Zhenming Liu, Feiteng Zhang\",\"doi\":\"10.1142/s0129054123460036\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The [Formula: see text]-truss was proposed by Jonathan Cohen in 2008, and it is a widely used as index in graph analysis for cohesive subgraph mining. There are two basic problems in this area. One is the truss decomposition problem, which is to compute the truss number of every edge; the other is the truss maintenance problem, which is to update the truss numbers of the affected edges in a dynamic graph while avoiding the truss number recomputation of all edges. However, few results are known on edge-weighted graphs. In this paper, we focus on the truss maintenance problem on edge-weighted graphs. Firstly, we propose a basic algorithm for the truss decomposition problem on edge-weighted graphs. Then we propose two indices, weighted growth potential support (WGPS) and weighted remaining potential support (WRPS), to help find the edges with potential changes on their truss numbers. Finally, we propose algorithms for the truss maintenance problem on edge-weighted graphs.\",\"PeriodicalId\":50323,\"journal\":{\"name\":\"International Journal of Foundations of Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Foundations of Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1142/s0129054123460036\",\"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":"International Journal of Foundations of Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1142/s0129054123460036","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

[Formula: see text]-truss是由Jonathan Cohen于2008年提出的,它被广泛用作内聚子图挖掘的图分析索引。这方面有两个基本问题。一是桁架分解问题,即计算每条边的桁架数;另一个是桁架维护问题,即更新动态图中受影响边的桁架数,同时避免所有边的桁架数重新计算。然而,关于边加权图的结果却很少。本文主要研究边加权图上的桁架维护问题。首先,提出了边权图桁架分解问题的基本算法。在此基础上,提出加权生长潜力支持度(WGPS)和加权剩余潜力支持度(WRPS)两个指标,以帮助寻找其桁架数可能发生变化的边缘。最后,我们提出了边加权图上桁架维护问题的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Algorithms for the Truss Maintenance Problem on Edge-Weighted Graphs
The [Formula: see text]-truss was proposed by Jonathan Cohen in 2008, and it is a widely used as index in graph analysis for cohesive subgraph mining. There are two basic problems in this area. One is the truss decomposition problem, which is to compute the truss number of every edge; the other is the truss maintenance problem, which is to update the truss numbers of the affected edges in a dynamic graph while avoiding the truss number recomputation of all edges. However, few results are known on edge-weighted graphs. In this paper, we focus on the truss maintenance problem on edge-weighted graphs. Firstly, we propose a basic algorithm for the truss decomposition problem on edge-weighted graphs. Then we propose two indices, weighted growth potential support (WGPS) and weighted remaining potential support (WRPS), to help find the edges with potential changes on their truss numbers. Finally, we propose algorithms for the truss maintenance problem on edge-weighted graphs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Foundations of Computer Science
International Journal of Foundations of Computer Science 工程技术-计算机:理论方法
CiteScore
1.60
自引率
12.50%
发文量
63
审稿时长
3 months
期刊介绍: The International Journal of Foundations of Computer Science is a bimonthly journal that publishes articles which contribute new theoretical results in all areas of the foundations of computer science. The theoretical and mathematical aspects covered include: - Algebraic theory of computing and formal systems - Algorithm and system implementation issues - Approximation, probabilistic, and randomized algorithms - Automata and formal languages - Automated deduction - Combinatorics and graph theory - Complexity theory - Computational biology and bioinformatics - Cryptography - Database theory - Data structures - Design and analysis of algorithms - DNA computing - Foundations of computer security - Foundations of high-performance computing
期刊最新文献
The 4-Set Tree Connectivity of Folded Hypercube An Efficient Algorithm to Compute Dot Product Dimension of Some Outerplanar Graphs The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem State Complexity of Boolean Operations on Graph-Walking Automata Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata Over Small Alphabets
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1