Algorithms for Extracting Timeliness Graphs

DOI10.1007/978-3-642-13284-1_11zbMath1284.68079arXiv1003.1058OpenAlexW1951835956MaRDI QIDQ3569121

Hugues Fauconnier, Carole Delporte-Gallet, Mikel Larrea, Stéphane Devismes

Publication date: 17 June 2010

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.1058

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Packet efficient implementation of the Omega failure detector

This page was built for publication: Algorithms for Extracting Timeliness Graphs