. "0895-4801" . "US - Spojen\u00E9 st\u00E1ty americk\u00E9" . . "Algorithms for Fault-Tolerant Routing in Circuit Switched Networks" . "Kolman, Petr" . . "17"^^ . "Algorithms for Fault-Tolerant Routing in Circuit Switched Networks"@en . . . "11320" . "RIV/00216208:11320/07:00004355" . . "Pr\u00E1ce se zab\u00FDv\u00E1 probl\u00E9mem hled\u00E1n\u00ED disjunktn\u00EDch cest v grafu."@cs . . . . . "409053" . "Algorithms; Fault-Tolerant; Routing; Circuit; Switched; Networks"@en . "Algoritmy pro chyb\u00E1m-odoln\u00E9 sm\u011Brov\u00E1n\u00ED v komunika\u010Dn\u00EDch s\u00EDt\u00EDch"@cs . . "Algorithms for Fault-Tolerant Routing in Circuit Switched Networks" . . "1"^^ . . "In this paper we consider the $k$ edge-disjoint paths problem ($k$-EDP), a generalization of the well-known edge-disjoint paths problem. Given a graph $G=(V,E)$ and a set of terminal pairs (or requests) $T$, the problem is to find a maximum subset of the pairs in $T$ for which it is possible to select paths such that each pair is connected by $k$ edge-disjoint paths and the paths for different pairs are mutually disjoint."@en . "RIV/00216208:11320/07:00004355!RIV08-MSM-11320___" . . . "141;157" . . "Algoritmy pro chyb\u00E1m-odoln\u00E9 sm\u011Brov\u00E1n\u00ED v komunika\u010Dn\u00EDch s\u00EDt\u00EDch"@cs . . . "4"^^ . "[CED15B95B3C8]" . "P(1M0545), Z(MSM0021620838)" . "1" . . "21" . "SIAM Journal on Discrete Mathematics" . "Algorithms for Fault-Tolerant Routing in Circuit Switched Networks"@en . . "In this paper we consider the $k$ edge-disjoint paths problem ($k$-EDP), a generalization of the well-known edge-disjoint paths problem. Given a graph $G=(V,E)$ and a set of terminal pairs (or requests) $T$, the problem is to find a maximum subset of the pairs in $T$ for which it is possible to select paths such that each pair is connected by $k$ edge-disjoint paths and the paths for different pairs are mutually disjoint." .