Pages that link to "Item:Q1607119"
From MaRDI portal
The following pages link to Maximal matching stabilizes in time \(O(m)\) (Q1607119):
Displaying 12 items.
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets (Q597323) (← links)
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086) (← links)
- A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem (Q719294) (← links)
- A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2 (Q719295) (← links)
- A self-stabilizing algorithm for cut problems in synchronous networks (Q962165) (← links)
- A new self-stabilizing maximal matching algorithm (Q1008731) (← links)
- A self-stabilizing algorithm for \(b\)-matching (Q1625602) (← links)
- A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs (Q2353636) (← links)
- The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs (Q2420642) (← links)
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives (Q2428653) (← links)
- Self-Stabilizing Domination Algorithms (Q3384122) (← links)
- Self-stabilizing Cuts in Synchronous Networks (Q3511402) (← links)
