A maximum degree self-stabilizing spanning tree algorithm

DOI10.1007/978-90-481-9794-1_73MaRDI QIDQ4932748zbMATH OpenOpenAlexFDO

Authors Deniz Cokuslu, Kayhan Erciyes, Abdelkader Hameurlain

Publication date 6 October 2010

Published in Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11147/2621

zbMATH Keywords

spanning tree construction algorithms

Mathematics Subject Classification ID

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

Recommendations

• A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
• A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
• Self-stabilizing minimum degree spanning tree within one from the optimal degree
• scientific article; zbMATH DE number 1442016
• scientific article; zbMATH DE number 4058884

Cited in

(4)

• A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks.
• A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
• A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
• scientific article; zbMATH DE number 1442016 (Why is no real title available?)

This page was built for publication: A maximum degree self-stabilizing spanning tree algorithm

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