On the Complexity of Removing Z-Cycles from a Checkpoints and Communication Pattern

DOI10.1109/TC.2007.1044zbMATH Open1390.68327OpenAlexW2109476794MaRDI QIDQ4564178FDOQ4564178

Authors: Luca Allulli, Roberto Baldoni, Luigi Laura, Sara Tucci Piergiovanni 

Publication date: 12 June 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2007.1044

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)

This page was built for publication: On the Complexity of Removing Z-Cycles from a Checkpoints and Communication Pattern

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