-Hub Routing Cost Problem in metric graphs.

Hao-Ping Yeh Wei Lu Li-Hsuan Chen Ling-Ju Hung Ralf Klasing Sun-Yuan Hsieh

Published in: Theor. Comput. Sci. (2022)

Keyphrases

maximum common subgraph
routing decisions
routing problem
metric space
routing algorithm
shortest path
high cost
directed graph
graph theory
weighted graph
graph mining
similarity metric
cost savings
network topologies
subgraph isomorphism
inter domain
ad hoc networks