Pages that link to "Item:Q5171159"
From MaRDI portal
The following pages link to Local Graph Partitions for Approximation and Testing (Q5171159):
Displaying 34 items.
- Testing outerplanarity of bounded degree graphs (Q494925) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- Every minor-closed property of sparse graphs is testable (Q962147) (← links)
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- Finite graphs and amenability (Q1760172) (← links)
- On the tree-width of even-hole-free graphs (Q1979431) (← links)
- Planarity can be verified by an approximate proof labeling scheme in constant-time (Q2154327) (← links)
- Hyperfinite graphings and combinatorial optimization (Q2220974) (← links)
- No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
- Local algorithms for sparse spanning graphs (Q2300722) (← links)
- On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs (Q2304167) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Infinite dimensional representations of finite dimensional algebras and amenability (Q2405948) (← links)
- Limits of locally-globally convergent graph sequences (Q2453451) (← links)
- New techniques and tighter bounds for local computation algorithms (Q2628795) (← links)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- Constructing near spanning trees with few local inspections (Q2977565) (← links)
- An Efficient Partitioning Oracle for Bounded-Treewidth Graphs (Q3088124) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs (Q3387757) (← links)
- Approximately Counting Triangles in Sublinear Time (Q4593251) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Sublinear Graph Approximation Algorithms (Q4933367) (← links)
- Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (Q4972298) (← links)
- (Q5002727) (← links)
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376) (← links)
- (Q5090414) (← links)
- On Approximating the Number of $k$-Cliques in Sublinear Time (Q5115700) (← links)
- Planar graphs: Random walks and bipartiteness testing (Q5236926) (← links)
- (Q5743463) (← links)
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726) (← links)
- Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs (Q5890147) (← links)
- Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs (Q6139828) (← links)
- Local-vs-global combinatorics (Q6198642) (← links)
