Structured connectivity augmentation

DOI10.4230/LIPICS.MFCS.2017.29MaRDI QIDQ5111243zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Structured connectivity augmentation
• Connectivity augmentation of graphs
• scientific article; zbMATH DE number 2080256
• Hypergraph connectivity augmentation
• A note on the vertex-connectivity augmentation problem

Cites work

• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Algorithmic Aspects of Graph Connectivity
• Augmentation Problems
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Connections in combinatorial optimization
• Detachments Preserving Local Edge-Connectivity of Graphs
• Edge-connectivity augmentation problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• Fundamentals of parameterized complexity
• Independence free graphs and vertex connectivity augmentation
• Minimum block containing a given graph
• On the optimal vertex-connectivity augmentation

Cited in

(4)

• Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems
• Structured connectivity augmentation
• scientific article; zbMATH DE number 1757953 (Why is no real title available?)
• Connectivity preserving network transformers

This page was built for publication: Structured connectivity augmentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111243)