Distributed verification of minimum spanning trees
DOI10.1145/1146381.1146389zbMath1314.68159MaRDI QIDQ5177261
Publication date: 10 March 2015
Published in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1146381.1146389
minimum spanning tree; distributed algorithms; network algorithms; labeling schemes; self stabilization; graph property verification; proof labeling
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05C12: Distance in graphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W15: Distributed algorithms
Related Items