On testing Hamiltonicity in the bounded degree graph model

DOI10.1007/978-3-031-88946-2_15MaRDI QIDQ6877273zbMATH OpenFDO

Authors Oded Goldreich

Publication date 8 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-88946-2_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx)

Cites work

• Introduction to Property Testing
• Property testing and its connection to learning and approximation
• Property testing in bounded degree graphs
• Robustly self-ordered graphs: constructions and applications to property testing
• Testing properties of directed graphs: acyclicity and connectivity*
• The hardness of approximation: Gap location
• The subgraph testing model

Cited in

(1)

• Quantum property testing in sparse directed graphs

This page was built for publication: On testing Hamiltonicity in the bounded degree graph model

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