"Searching the Shortest Pair of Edge-Disjoint Paths in a Communication ..."

Lissette Valdés et al. (2019)

Details and statistics

DOI: 10.1007/978-3-030-20518-8_53

access: closed

type: Conference or Workshop Paper

metadata version: 2022-10-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics