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