The \((2, k)\)-connectivity augmentation problem: algorithmic aspects

DOI10.1007/s00453-021-00829-4OpenAlexW3167906013MaRDI QIDQ2041970

Florian Hoersch, Zoltán Szigeti

Publication date: 26 July 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.08645

zbMATH Keywords

connectivity augmentationbisetssplitting offmixed connectivity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Graph connectivity and its augmentation: Applications of MA orderings
• Edge-connectivity augmentation problems
• Augmenting hypergraphs by edges of size two
• Covering symmetric supermodular functions by graphs
• Independence free graphs and vertex connectivity augmentation
• On minimally \((n,\lambda)\)-connected graphs
• Minimal edge-coverings of pairs of sets
• Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph
• Edge-Connectivity Augmentations of Graphs and Hypergraphs
• The minimum augmentation of any graph to aK-edge-connected graph
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Augmentation Problems
• Edge-Connectivity Augmentation Preserving Simplicity
• Edge-Connectivity Augmentation with Partition Constraints
• Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
• Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph
• On ‐connected graphs

This page was built for publication: The \((2, k)\)-connectivity augmentation problem: algorithmic aspects