Pages that link to "Item:Q2075766"
From MaRDI portal
The following pages link to Sublinear-time algorithms for approximating graph parameters (Q2075766):
Displaying 9 items.
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth (Q1041722) (← links)
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs (Q4575605) (← links)
- Sublinear Random Access Generators for Preferential Attachment Graphs (Q5035872) (← links)
- Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
- Parameterized Approximation Schemes Using Graph Widths (Q5167791) (← links)
- Parameterized and approximation complexity of the detection pair problem in graphs (Q5371038) (← links)
- (Q5491026) (← links)
- (Q5743440) (← links)
- Approximation algorithms in graphs with known broadcast time of the base graph (Q6102286) (← links)