scientific article; zbMATH DE number 3978410

MaRDI QIDQ3742736zbMATH OpenFDO

Authors Roberto Tamassia, Ioannis G. Tollis

Publication date 1986

zbMATH Keywords

linear time algorithmsVLSI layoutefficient embedding of graphs in the rectilinear grid

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• A unified approach to visibility representations of planar graphs
• Improved visibility representation of plane graphs
• Some results on visibility graphs
• Visibility representation of plane graphs via canonical ordering tree
• STACS 2004

Cited in

(14)

• Towards area requirements for drawing hierarchically planar graphs
• Representations of Graphs on a Cylinder
• Improved visibility representation of plane graphs
• scientific article; zbMATH DE number 4049090 (Why is no real title available?)
• scientific article; zbMATH DE number 140479 (Why is no real title available?)
• Embedding-preserving rectangle visibility representations of nonplanar graphs
• Simultaneous visibility representations of undirected pairs of graphs
• Topological sweep of the complete graph
• A unified approach to visibility representations of planar graphs
• Special graph representation and visualization of semantic networks
• scientific article; zbMATH DE number 1962799 (Why is no real title available?)
• Upward planar morphs
• On visibility representations of non-planar graphs
• An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem

This page was built for publication:

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