General theoretical results on rectilinear embeddability of graphs
From MaRDI portal
Publication:809088
DOI10.1007/BF02006104zbMath0732.05021MaRDI QIDQ809088
Yanpei Liu, Bruno Simeone, Aurora Morgana
Publication date: 1991
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
05C10: Planar graphs; geometric and topological aspects of graph theory
94C15: Applications of graph theory to circuits and networks
Related Items
Theoretical results on at most 1-bend embeddability of graphs, Advances in the theory and practice of graph drawing, At most single-bend embeddings of cubic graphs, Single bend wiring on surfaces, A graph partition problem, A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid, A better heuristic for orthogonal graph drawings, Boolean approaches to graph embeddings related to VLSI, An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid, Orthogonal drawings of graphs for the automation of VLSI circuit design, Unnamed Item
Cites Work