Routing complexity of faulty networks

DOI10.1002/RSA.20163MaRDI QIDQ6829765zbMATH OpenFDO

Authors Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder

Publication date 18 January 2008

Published in Random Structures \& Algorithms (Search for Journal in Brave)

zbMATH Keywords

phase transitionhypercubelower boundpercolation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

This page was built for publication: Routing complexity of faulty networks

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