scientific article; zbMATH DE number 1735731

MaRDI QIDQ4329124zbMATH OpenFDO

Authors

Publication date 29 September 2002

zbMATH Keywords

matchingself-stabilizing algorithmtree

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A self-stabilizing 23-approximation algorithm for the maximum matching problem
• High Performance Computing - HiPC 2003
• Dynamic and self-stabilizing distributed matching

Cited in

(10)

• Stabilizing maximum matching in bipartite networks
• A self-stabilizing algorithm for b-matching
• Self-Stabilizing Domination Algorithms
• A O(m) self-stabilizing algorithm for maximal triangle partition of general graphs
• scientific article; zbMATH DE number 2114409 (Why is no real title available?)
• High Performance Computing - HiPC 2003
• Maximum matching for anonymous trees with constant space per process
• Brief Announcement
• A self-stabilizing 23-approximation algorithm for the maximum matching problem
• A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2

This page was built for publication:

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