Pages that link to "Item:Q4641588"
From MaRDI portal
The following pages link to Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) (Q4641588):
Displaying 6 items.
- Upper and lower bounds for fully retroactive graph problems (Q832892) (← links)
- Deterministic dynamic matching in \(O(1)\) update time (Q2300734) (← links)
- Simple Deterministic Algorithms for Fully Dynamic Maximal Matching (Q4962204) (← links)
- (Q5092428) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- Fully Dynamic Maximal Independent Set with Sublinear in <i>n</i> Update Time (Q5236302) (← links)