On the complexity of embedding planar graphs to minimize certain distance measures

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

Publication:582079

DOI10.1007/BF01840379zbMATH Open0689.68044MaRDI QIDQ582079

Author name not available (Why is that?)

Publication date: 1990

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: On the complexity of embedding planar graphs to minimize certain distance measures

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

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