Pages that link to "Item:Q5056427"
From MaRDI portal
The following pages link to Lower Bounds for Maximal Matchings and Maximal Independent Sets (Q5056427):
Displaying 14 items.
- Independent sets versus perfect matchings (Q673116) (← links)
- Distributed independent sets in interval and segment intersection graphs (Q831804) (← links)
- Linear-in-\(\varDelta \) lower bounds in the LOCAL model (Q1689747) (← links)
- Linial for lists (Q2104037) (← links)
- From matchings to independent sets (Q2403787) (← links)
- Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Some simple distributed algorithms for sparse networks (Q5138354) (← links)
- (Q5167453) (← links)
- Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets (Q5855210) (← links)
- Locally checkable problems in rooted trees (Q6096035) (← links)
- Distributed half-integral matching and beyond (Q6199402) (← links)
- Stackelberg strategies on epidemic containment games (Q6535824) (← links)
- Luby's MIS algorithms made self-stabilizing (Q6663516) (← links)