A multicast routing algorithm based on searching in directed graph

DOI10.1016/J.AMC.2011.09.017zbMath1242.05262OpenAlexW2054689198MaRDI QIDQ426417

Yuhua Xu, Jing Gong, Zhiguang Ren, Zhi-Xin Sun

Publication date: 11 June 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.09.017

zbMATH Keywords

directed graphsimulated annealing algorithmant algorithmdelay and delay variation boundedmulticast routing algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Globally hyperbolic moment model of arbitrary order for one-dimensional special relativistic Boltzmann equation

Cites Work

• A note on two problems in connexion with graphs
• Optimization by Simulated Annealing
• Unnamed Item

This page was built for publication: A multicast routing algorithm based on searching in directed graph