Pages that link to "Item:Q3419593"
From MaRDI portal
The following pages link to Covering minimum spanning trees of random subgraphs (Q3419593):
Displaying 6 items.
- Minimum vertex cover in generalized random graphs with power law degree distribution (Q306728) (← links)
- A tight bound on the collection of edges in MSTs of induced subgraphs (Q1003845) (← links)
- Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
- Optimal bounds on approximation of submodular and XOS functions by juntas (Q2816303) (← links)
- Minimal vertex covers of random trees (Q4968859) (← links)
- Covering random graphs with monochromatic trees (Q6074874) (← links)