Self-stabilizing deterministic network decomposition

DOI10.1006/JPDC.2001.1811MaRDI QIDQ697021zbMATH OpenOpenAlexFDO

Authors M. C. Fu

Publication date 12 September 2002

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.2001.1811

zbMATH Keywords

network partitioningself-stabilizing protocol

Mathematics Subject Classification ID

Network protocols (68M12)

Recommendations

• Distributed Computing - IWDC 2003
• Self-stabilization with path algebra
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs
• Distributed Computing – IWDC 2005

Cited in

(3)

• A self-stabilizing general de Bruijn graph
• A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs
• Sublinear fully distributed partition with applications

This page was built for publication: Self-stabilizing deterministic network decomposition

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