An efficient minimum and maximum global snapshot algorithm

DOI10.1016/S0020-0190(02)00485-4zbMATH Open1173.68383OpenAlexW2062709155MaRDI QIDQ1007591FDOQ1007591

Authors: J. Martínez 

Publication date: 23 March 2009

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00485-4

zbMATH Keywords

distributed systemsmaximum flowcombinatorial problemsglobal snapshot

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Distributed systems (68M14)

Cites Work

• Maximal Flow Through a Network
• A new approach to the maximum-flow problem
• On the time complexity of minimum and maximum global snapshot problems
• On Detection of Bounded Global Predicates

This page was built for publication: An efficient minimum and maximum global snapshot algorithm

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