Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction

Published:2013 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13
language:
Short-container-title:

Author:

Akiba Takuya,Iwata Yoichi,Yoshida Yuichi

Publisher

ACM Press

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

1. Efficient Computation of K-Edge Connected Components: An Empirical Analysis;Lecture Notes in Computer Science;2024

2. A fast approximate method for k-edge connected component detection in graphs with high accuracy;Information Sciences;2023-07

3. A near-optimal approach to edge connectivity-based hierarchical graph decomposition;The VLDB Journal;2023-05-06

4. Verification-Free Approaches to Efficient Locally Densest Subgraph Discovery;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04

5. An efficient updation approach for enumerating maximal (Δ, γ)-cliques of a temporal network;Journal of Complex Networks;2022-08-23

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP