Pages that link to "Item:Q5171159"
From MaRDI portal
The following pages link to Local Graph Partitions for Approximation and Testing (Q5171159):
Displaying 13 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)
- (Q5002727) (← links)
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376) (← links)
- (Q5090414) (← links)
- Planar graphs: Random walks and bipartiteness testing (Q5236926) (← links)
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726) (← 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)
