Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width
From MaRDI portal
Publication:2798213
DOI10.1007/978-3-319-29516-9_2zbMath1417.68146OpenAlexW2977517824MaRDI QIDQ2798213
Erlebach, Thomas, Hasna Mohsen Alqahtani
Publication date: 4 April 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-29516-9_2
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
This page was built for publication: Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width
