Pages that link to "Item:Q5252659"
From MaRDI portal
The following pages link to Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Q5252659):
Displaying 13 items.
- Approximating dynamic weighted vertex cover with soft capacities (Q2072101) (← links)
- Dynamic clustering to minimize the sum of radii (Q2205631) (← links)
- Dynamic rank-maximal and popular matchings (Q2420654) (← links)
- Randomization for Efficient Dynamic Graph Algorithms (Q2795930) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) (Q4641588) (← links)
- (Q5002673) (← links)
- (Q5009521) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- (Q5111737) (← links)
- Dynamic Matching Algorithms in Practice (Q5874529) (← links)
- Dynamic graph coloring (Q5915986) (← links)
- Deterministic dynamic matching in worst-case update time (Q6066769) (← links)
