A Note on Graphs with 2 Bends
classification
💻 cs.CC
keywords
graphsbendsline-bendnotenp-completenessproblemrecognition
read the original abstract
We show NP-completeness for the recognition problem of 2-line-bend graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.