Pages that link to "Item:Q4962788"

The following pages link to Approximating the distance to properties in bounded-degree and general sparse graphs (Q4962788):

Displayed 12 items.

• Local computation algorithms for graphs of non-constant degrees (Q524360) ‎ (← links)
• Local algorithms for sparse spanning graphs (Q2300722) ‎ (← links)
• Constructing near spanning trees with few local inspections (Q2977565) ‎ (← links)
• An Efficient Partitioning Oracle for Bounded-Treewidth Graphs (Q3088124) ‎ (← links)
• Approximately Counting Triangles in Sublinear Time (Q4593251) ‎ (← links)
• Sublinear Graph Approximation Algorithms (Q4933367) ‎ (← links)
• Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (Q4972298) ‎ (← links)
• (Q5090430) ‎ (← links)
• On Approximating the Number of $k$-Cliques in Sublinear Time (Q5115700) ‎ (← links)
• Planar graphs: Random walks and bipartiteness testing (Q5236926) ‎ (← links)
• (Q5743463) ‎ (← links)
• Approximating the distance to monotonicity of Boolean functions (Q6074683) ‎ (← links)