Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The efficient recognition on net-extensibility of graphs

From MaRDI portal
Publication:687910
Jump to:navigation, search

zbMATH Open0791.05023MaRDI QIDQ687910FDOQ687910


Authors: Yanpei Liu Edit this on Wikidata


Publication date: 28 June 1994

Published in: Chinese Science Bulletin (Search for Journal in Brave)





Recommendations

  • Publication:4724655
  • scientific article; zbMATH DE number 432759
  • Optimally extending bistandard graphs on the orthogonal grid (extended abstract)
  • On Embedding a Graph in the Grid with the Minimum Number of Bends
  • How to draw a planar graph on a grid


zbMATH Keywords

algorithmembeddingplanenet-extension


Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)



Cited In (3)

  • Some combinatorial optimization problems arising from VLSI circuit design
  • Title not available (Why is that?)
  • Orthogonal drawings of graphs for the automation of VLSI circuit design





This page was built for publication: The efficient recognition on net-extensibility of graphs

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:687910&oldid=12589246"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 09:26. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki