Toward fast calculation of communication paths for resilient routing

DOI10.1002/NET.21789WikidataQ62048694 ScholiaQ62048694MaRDI QIDQ6496360

Jacek Rak, Łukasz Kuszner, Kanstantsin Myslitski

Publication date: 3 May 2024

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

optimizationnetwork resiliencesurvivable routingend-to-end communications resiliencefailures of network nodes/linksfast computation of communication paths

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• A quick method for finding shortest pairs of disjoint paths
• Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs

This page was built for publication: Toward fast calculation of communication paths for resilient routing