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 条

[41] On low bound of degree sequences of spanning trees in K-edge-connected graphs
Liu, ZH
Xu, BG
JOURNAL OF GRAPH THEORY, 1998, 28 (02) : 87 - 95
[42] A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected
Jian-hua YIN
Ji-yun GUO
ActaMathematicaeApplicataeSinica, 2022, 38 (01) : 223 - 228
[43] A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected
Yin, Jian-hua
Guo, Ji-yun
ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2022, 38 (01): : 223 - 228
[44] SYMBOLIC PROGRAM ANALYSIS IN ALMOST-LINEAR TIME
REIF, JH
TARJAN, RE
SIAM JOURNAL ON COMPUTING, 1982, 11 (01) : 81 - 93
[45] A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
Fernandes, CG
PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 629 - 638
[46] A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected
Jian-hua Yin
Ji-yun Guo
Acta Mathematicae Applicatae Sinica, English Series, 2022, 38 : 223 - 228
[47] REDISTRIBUTION OF VERTICES FOR MAXIMUM EDGE COUNT IN K-EDGE-CONNECTED D-CRITICAL GRAPHS
CACCETTA, L
SMYTH, WF
ARS COMBINATORIA, 1988, 26B : 115 - 132
[48] On the extremal sizes of maximal graphs without (k+1)-connected subgraphs
Xu, Liqiong
Lai, Hong-Jian
Tian, Yingzhi
DISCRETE APPLIED MATHEMATICS, 2020, 285 : 397 - 406
[49] Note on 2-edge-colorings of complete graphs with small monochromatic k-connected subgraphs
JIN Ze-min
WANG Yu-ling
WEN Shi-li
Applied Mathematics:A Journal of Chinese Universities, 2014, (02) : 249 - 252
[50] A better approximation ratio for the minimum size k-edge-connected spanning subgraph problem
Fernandes, CG
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1998, 28 (01): : 105 - 124

← 1 2 3 4 5 →