Login / Signup
The complexity of testing all properties of planar graphs, and the role of isomorphism.
Sabyasachi Basu
Akash Kumar
C. Seshadhri
Published in:
Electron. Colloquium Comput. Complex. (2021)
Keyphrases
</>
planar graphs
computational complexity
np hard
minimum weight