Finding forbidden minors in sublinear time: a n^1/2+o(1)-query one-sided tester for minor closed properties on bounded degree graphs

DOI10.1109/FOCS.2018.00055MaRDI QIDQ6944359zbMATH OpenFDO

Authors Andrew M. Stolman, A. Kumar, C. Seshadhri

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2018.00055

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(3)

• Planarity via spanning tree number: a linear-algebraic criterion
• Multiple random walks on graphs: mixing few to cover many
• Narrowing the \textsf{LOCAL-CONGEST} gaps in sparse networks via expander decompositions

This page was built for publication: Finding forbidden minors in sublinear time: a \(n^{1/2+o(1)}\)-query one-sided tester for minor closed properties on bounded degree graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944359)