String graphs. II: Recognizing string graphs is NP-hard

From MaRDI portal
Revision as of 02:30, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1112845

DOI10.1016/0095-8956(91)90091-WzbMATH Open0661.05054MaRDI QIDQ1112845

Author name not available (Why is that?)

Publication date: 1991

Published in: (Search for Journal in Brave)




zbMATH Keywords

No records found.


Mathematics Subject Classification ID

No records found.








This page was built for publication: String graphs. II: Recognizing string graphs is NP-hard

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

Retrieved from "https://mardi.schubotz.org/w/index.php?title=Publication:1112845&oldid=13156473"
Powered by MediaWiki