Pages that link to "Item:Q5091165"
From MaRDI portal
The following pages link to When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165):
Displaying 4 items.
- Distributed backup placement (Q2084982) (← links)
- A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs (Q2403797) (← links)
- Fully dynamic maximal independent set with sublinear update time (Q5230340) (← links)
- Fully Dynamic Maximal Independent Set with Sublinear in <i>n</i> Update Time (Q5236302) (← links)