On the time complexity of minimum and maximum global snapshot problems

DOI10.1016/S0020-0190(98)00100-8zbMath1339.68114OpenAlexW2076740206MaRDI QIDQ293343

I-Chen Wu, Loon-Been Chen

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001008?np=y

zbMATH Keywords

computational complexitydistributed systemserror detectionglobal snapshot

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Flows in graphs (05C21)

Related Items (1)

An efficient minimum and maximum global snapshot algorithm

Cites Work

• A new approach to the maximum-flow problem
• Time, clocks, and the ordering of events in a distributed system
• On Detection of Bounded Global Predicates

This page was built for publication: On the time complexity of minimum and maximum global snapshot problems