Algorithms for Fault-Tolerant Routing in Circuit Switched Networks

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F07%3A00004355" target="_blank" >RIV/00216208:11320/07:00004355 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Algorithms for Fault-Tolerant Routing in Circuit Switched Networks
Original language description
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 thepairs 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.
Czech name
Algoritmy pro chybám-odolné směrování v komunikačních sítích
Czech description
Práce se zabývá problémem hledání disjunktních cest v grafu.

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)