An Efficient Algorithm for All-Pairs Bounded Edge Connectivity (English)
Free access
- New search for: Akmal, Shyan
- Further information on Akmal, Shyan:
- https://orcid.org/https://orcid.org/0000-0002-7266-2041
- New search for: Jin, Ce
- New search for: Akmal, Shyan
- Further information on Akmal, Shyan:
- https://orcid.org/https://orcid.org/0000-0002-7266-2041
- New search for: Jin, Ce
In:
Algorithmica
;
86
, 5
;
1623-1656
;
2024
- Article (Journal) / Electronic Resource
-
Title:An Efficient Algorithm for All-Pairs Bounded Edge Connectivity
-
Additional title:Algorithmica
-
Contributors:Akmal, Shyan ( author ) / Jin, Ce ( author )
-
Published in:Algorithmica ; 86, 5 ; 1623-1656
-
Publisher:
- New search for: Springer US
-
Place of publication:New York
-
Publication date:2024-05-01
-
Size:34 pages
-
ISSN:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Electronic Resource
-
Language:English
- New search for: Mathematics of computing / Graph algorithms
- Further information on Mathematics Subject Classification
-
Keywords:
-
Classification:
-
Licence:
-
Source:
Table of contents – Volume 86, Issue 5
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1293
-
Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse GraphsXiao, Mingyu / Huang, Sen / Chen, Xiaoyu et al. | 2024
- 1335
-
Stochastic Variance Reduction for DR-Submodular MaximizationLian, Yuefang / Du, Donglei / Wang, Xiao / Xu, Dachuan / Zhou, Yang et al. | 2024
- 1365
-
Theoretical Analysis of Git BisectCourtiel, Julien / Dorbec, Paul / Lecoq, Romain et al. | 2024
- 1400
-
Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion TimeGong, Mingyang / Chen, Zhi-Zhong / Hayashi, Kuniteru et al. | 2024
- 1428
-
Domination and Cut Problems on Chordal Graphs with Bounded LeafageGalby, Esther / Marx, Dániel / Schepper, Philipp / Sharma, Roohani / Tale, Prafullkumar et al. | 2024
- 1475
-
On Structural Parameterizations of the Harmless Set ProblemGaikwad, Ajinkya / Maity, Soumen et al. | 2024
- 1512
-
Connectivity with Uncertainty Regions Given as Line SegmentsCabello, Sergio / Gajser, David et al. | 2024
- 1545
-
Approximations for Throughput MaximizationHyatt-Denesik, Dylan / Rahgoshay, Mirmahdi / Salavatipour, Mohammad R. et al. | 2024
- 1578
-
Predecessor on the Ultra-Wide Word RAMBille, Philip / Gørtz, Inge Li / Stordalen, Tord et al. | 2024
- 1600
-
Truthful Matching with Online Items and Offline AgentsFeldman, Michal / Fusco, Federico / Leonardi, Stefano / Mauras, Simon / Reiffenhäuser, Rebecca et al. | 2024
- 1623
-
An Efficient Algorithm for All-Pairs Bounded Edge ConnectivityAkmal, Shyan / Jin, Ce et al. | 2024
- 1657
-
Improved FPT Algorithms for Deletion to Forest-Like StructuresGowda, Kishen N. / Lonkar, Aditya / Panolan, Fahad / Patel, Vraj / Saurabh, Saket et al. | 2024
- 1700
-
Exploration of High-Dimensional Grids by Finite State MachinesDobrev, Stefan / Narayanan, Lata / Opatrny, Jaroslav / Pankratov, Denis et al. | 2024