The hardness of embedding grids and walls

DOI10.1007/978-3-319-68705-6_14zbMath1483.05176arXiv1703.06423OpenAlexW2604140850MaRDI QIDQ1687915

Yijia Chen, Martin Grohe, Bingkai Lin

Publication date: 4 January 2018

Full work available at URL: https://arxiv.org/abs/1703.06423

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle