The efficient recognition on net-extensibility of graphs

zbMATH Open0791.05023MaRDI QIDQ687910FDOQ687910

Authors: Yanpei Liu 

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)