Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k

被引：0

|

作者：

University of Michigan, United States ^{[1
]}

不详 ^{[2
]}

机构：

来源：

arXiv | 1600年

关键词：

Compilation and indexing terms; Copyright 2025 Elsevier Inc;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Undirected graphs

引用

收藏

相关论文

共 50 条

[1] Linear-Time Enumeration of Maximal k-Edge-Connected Subgraphs in Large Networks by Random Contraction
Akiba, Takuya
Iwata, Yoichi
Yoshida, Yuichi
PROCEEDINGS OF THE 22ND ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM'13), 2013, : 909 - 918
[2] Mining Frequent k-edge-Connected Subgraphs
Tan, Jingdong
Wang, Rujing
2016 12TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY (ICNC-FSKD), 2016, : 1312 - 1317
[3] Subgraphs decomposable into two trees and k-edge-connected subgraphs
Hassin, R
Levin, A
DISCRETE APPLIED MATHEMATICS, 2003, 126 (2-3) : 181 - 195
[4] Maximal k-Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction
Nalam, Chaitanya
Saranurak, Thatchaphol
PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 183 - 211
[5] Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs
Dory, Michal
PODC'18: PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2018, : 149 - 158
[6] On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks
Jordán, T
DISCRETE APPLIED MATHEMATICS, 2003, 131 (02) : 421 - 432
[7] Minimally k-edge-connected directed graphs of maximal size
Berg, AR
Jordán, T
GRAPHS AND COMBINATORICS, 2005, 21 (01) : 39 - 50
[8] Minimally k-Edge-Connected Directed Graphs of Maximal Size
Alex R. Berg
Tibor Jordán
Graphs and Combinatorics, 2005, 21 : 39 - 50
[9] Packing spanning trees and spanning 2-connected k-edge-connected essentially -edge-connected subgraphs
Gu, Xiaofeng
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (03) : 924 - 933
[10] PATHS IN K-EDGE-CONNECTED GRAPHS
OKAMURA, H
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1988, 45 (03) : 345 - 355

← 1 2 3 4 5 →