Pages that link to "Item:Q2925521"
From MaRDI portal
The following pages link to Finding cycles and trees in sublinear time (Q2925521):
Displaying 12 items.
- Stability structures of conjunctive Boolean networks (Q1640224) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs (Q2304167) (← links)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- Finding cycles and trees in sublinear time (Q2925521) (← 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)
- Finding even cycles faster via capped k-walks (Q4977965) (← links)
- A sublinear tester for outerplanarity (and other forbidden minors) with one-sided error (Q5002727) (← links)
- (Q5002766) (← 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)
- Find subtrees of specified weight and cycles of specified length in linear time (Q6056757) (← 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)
