Pages that link to "Item:Q719294"
From MaRDI portal
The following pages link to A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem (Q719294):
Displaying 10 items.
- Conditional matching preclusion for the arrangement graphs (Q653318) (← links)
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086) (← links)
- A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2 (Q719295) (← links)
- A new self-stabilizing maximal matching algorithm (Q1008731) (← links)
- Stabilizing maximum matching in bipartite networks (Q1014349) (← links)
- A self-stabilizing algorithm for \(b\)-matching (Q1625602) (← links)
- The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs (Q2420642) (← links)
- Polynomial self-stabilizing maximum matching algorithm with approximation ratio 2/3 (Q3174934) (← links)
- Self-Stabilizing Domination Algorithms (Q3384122) (← links)
- Brief Announcement (Q5368993) (← links)