Structured Connectivity Augmentation

DOI10.4230/LIPIcs.MFCS.2017.29zbMath1441.05125OpenAlexW2901627276MaRDI QIDQ5111243

Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos

Publication date: 26 May 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2017.29

zbMATH Keywords

complexityconnectivity augmentationgraph superposition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Cites Work

• Fundamentals of parameterized complexity
• Edge-connectivity augmentation problems
• Minimum block containing a given graph
• Independence free graphs and vertex connectivity augmentation
• On the optimal vertex-connectivity augmentation
• Algorithmic Aspects of Graph Connectivity
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Augmentation Problems
• Detachments Preserving Local Edge-Connectivity of Graphs
• Fibonacci heaps and their uses in improved network optimization algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: Structured Connectivity Augmentation