Planarity can be Verified by an Approximate Proof Labeling Scheme in Constant-Time
From MaRDI portal
Publication:6343399
DOI10.1016/J.JCTA.2022.105643arXiv2006.11869WikidataQ113871615 ScholiaQ113871615MaRDI QIDQ6343399
Publication date: 21 June 2020
Algorithms in computer science (68Wxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)
This page was built for publication: Planarity can be Verified by an Approximate Proof Labeling Scheme in Constant-Time