Routing on the Shortest Pairs of Disjoint Paths.

Péter Babarczi Gábor Rétvári Lajos Rónyai János Tapolcai

Published in: IFIP Networking (2022)

Keyphrases

disjoint paths
shortest path
approximation algorithms
directed graph
routing algorithm
routing problem
undirected graph
pairwise
ad hoc networks
network topology
routing protocol
real time
association rules
minimum cost
routing decisions