A O(m) self-stabilizing algorithm for maximal triangle partition of general graphs

DOI10.1142/S0129626417500049MaRDI QIDQ4598938zbMATH OpenFDO

Authors Brahim Neggazi, Volker Turau, Mohammed Haddad, H. Kheddouci

Publication date 15 December 2017

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129626417500049

zbMATH Keywords

fault-toleranceself-stabilizing algorithmstriangle packingtriangle partitiontripartite matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• A self-stabilizing 23-approximation algorithm for the maximum matching problem
• scientific article; zbMATH DE number 1735731
• Polynomial self-stabilizing maximum matching algorithm with approximation ratio 2/3

Cited in

(1)

• A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs

This page was built for publication: A \(O(m)\) self-stabilizing algorithm for maximal triangle partition of general graphs

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