Pages that link to "Item:Q911306"
From MaRDI portal
The following pages link to An efficient distributed algorithm for maximum matching in general graphs (Q911306):
Displaying 8 items.
- A \(2\cdot | E |\)-bit distributed algorithm for the directed Euler trail problem (Q685488) (← links)
- Stabilizing maximum matching in bipartite networks (Q1014349) (← links)
- Distributed maximum maintenance on hierarchically divided graphs (Q2366165) (← links)
- Distributed Algorithm for Better Approximation of the Maximum Matching (Q3082932) (← links)
- Maintaining bipartite matchings in the presence of failures (Q3141219) (← links)
- (Q4250185) (← links)
- Algorithms – ESA 2004 (Q5464584) (← links)
- An efficient distributed algorithm for finding all hinge vertices in networks (Q5466762) (← links)