Pages that link to "Item:Q4933386"
From MaRDI portal
The following pages link to Dynamic Approximate Vertex Cover and Maximum Matching (Q4933386):
Displaying 6 items.
- Shortest augmenting paths for online matchings on trees (Q1743118) (← links)
- Maintaining a large matching and a small vertex cover (Q2875173) (← links)
- DMVP: Foremost Waypoint Coverage of Time-Varying Graphs (Q2945178) (← links)
- Fully Dynamic 2-Hop Cover Labeling (Q4629540) (← links)
- Optimal lower bounds for matching and vertex cover in dynamic graph streams (Q5092481) (← links)
- Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. (Q6075891) (← links)