Finding critical regions and region-disjoint paths in a network

None, None; None, None; None, None; None, None; None, None

Finding critical regions and region-disjoint paths in a network

Journal Article (2015)

Author(s)

S Trajanovski (TU Delft - Electrical Engineering, Mathematics and Computer Science)

FA Kuipers (TU Delft - Electrical Engineering, Mathematics and Computer Science)

A Ilic

J Crowcroft

PFA Van Mieghem (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Research Group

Network Architectures and Services

DOI related publication

https://doi.org/10.1109/TNET.2014.2309253 Final published version

To reference this document use

https://resolver.tudelft.nl/uuid:a37f8027-5932-4eb5-96b2-20713fcf2dd3

More Info

expand_more

Publication Year

2015

Language

English

Research Group

Network Architectures and Services

Issue number

3

Volume number

23

Pages (from-to)

908-921

Downloads counter

229

Collections

Institutional Repository

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Files

ToN2015_FindCriticalRegionsDis... (pdf)

(pdf | 3.16 Mb)

License info not available