Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation
From MaRDI portal
Publication:5326605
DOI10.1007/978-3-642-39206-1_61zbMath1336.68141OpenAlexW2611162368MaRDI QIDQ5326605
Publication date: 6 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: http://eprints.lse.ac.uk/69225/1/Vegh_Fixed_parameter.pdf
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (4)
Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ Polynomial kernels for weighted problems ⋮ Unnamed Item ⋮ Path-Contractions, Edge Deletions and Connectivity Preservation
This page was built for publication: Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation
