The Maximum Edge-Disjoint Paths Problem in Bidirected Trees
From MaRDI portal
Publication:2753529
DOI10.1137/S0895480199361259zbMath0977.68043MaRDI QIDQ2753529
Erlebach, Thomas, Klaus Jansen
Publication date: 11 November 2001
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Parameterized maximum path coloring, Minimal multicut and maximal integer multiflow: a survey, Conversion of coloring algorithms into maximum weight independent set algorithms, Call control with \(k\) rejections, Parameterized Maximum Path Coloring, GreedyMAX-type Algorithms for the Maximum Independent Set Problem, Competitive algorithms and lower bounds for online randomized call control in cellular networks, Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees