Time complexity of link reversal routing

DOI10.1145/2644815MaRDI QIDQ4962176zbMATH OpenOpenAlexFDO

Authors Bernadette Charron-Bost, Matthias Függer, Josef Widder, Jennifer L. Welch

Publication date 30 October 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2644815

zbMATH Keywords

linear dynamical systemslink reversalmin-plus algebraroutingtime complexity

Mathematics Subject Classification ID

Distributed systems (68M14) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Analysis of Link Reversal Routing Algorithms
• Link reversal routing with binary link labels: work complexity
• Efficient checking of link-reversal-based concurrent systems
• Routing in series parallel networks
• ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS

Cited in

(5)

• Link reversal routing with binary link labels: work complexity
• Efficient checking of link-reversal-based concurrent systems
• New transience bounds for max-plus linear systems
• Analysis of Link Reversal Routing Algorithms
• On the tightness of bounds for transients of weak CSR expansions and periodicity transients of critical rows and columns of tropical matrix powers

This page was built for publication: Time complexity of link reversal routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4962176)