Link reversal routing with binary link labels: work complexity

DOI10.1137/110843095MaRDI QIDQ2840988zbMATH OpenOpenAlexFDO

Authors Bernadette Charron-Bost, Antoine Gaillard, Josef Widder, Jennifer L. Welch

Publication date 24 July 2013

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1969.1/178676

zbMATH Keywords

applications of game theorycomplexity of algorithmslink reversal routingwireless networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Analysis of algorithms (68W40) Applications of game theory (91A80)

Recommendations

• Time complexity of link reversal routing
• Analysis of Link Reversal Routing Algorithms
• Complexity of inverse shortest path routing
• Labelling and Implicit Routing in Networks
• scientific article; zbMATH DE number 1932373
• The complexity of rerouting shortest paths
• The complexity of rerouting shortest paths

Cited in

(4)

• Efficient checking of link-reversal-based concurrent systems
• Time complexity of link reversal routing
• New transience bounds for max-plus linear systems
• Analysis of Link Reversal Routing Algorithms

This page was built for publication: Link reversal routing with binary link labels: work complexity

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