Parallel Processing and Applied Mathematics

DOI10.1007/11752578MaRDI QIDQ5899119zbMATH OpenOpenAlexFDO

Authors Adrian Kosowski, Łukasz Kuszner

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11752578

Mathematics Subject Classification ID

Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• A new polynomial silent stabilizing spanning-tree construction algorithm
• A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
• Self-stabilizing depth-first search
• scientific article; zbMATH DE number 1442016
• Time Optimal Asynchronous Self-stabilizing Spanning Tree

Cited in

(10)

• The local detection paradigm and its applications to self-stabilization
• Optimized silent self-stabilizing scheme for tree-based constructions
• The first fully polynomial stabilizing algorithm for BFS tree construction
• The first fully polynomial stabilizing algorithm for BFS tree construction
• A new polynomial silent stabilizing spanning-tree construction algorithm
• scientific article; zbMATH DE number 1442016 (Why is no real title available?)
• A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given
• How to improve snap-stabilizing point-to-point communication space complexity?
• Acyclic strategy for silent self-stabilization in spanning forests
• Asynchronous self-stabilization made fast, simple, and energy-efficient

This page was built for publication: Parallel Processing and Applied Mathematics

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