Graph layout for applications in compiler construction

DOI10.1016/S0304-3975(98)00270-9zbMath0914.68032WikidataQ123204749 ScholiaQ123204749MaRDI QIDQ1285776

K. Appert

Publication date: 28 April 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

graph drawinggraph layoutcompiler visualizationcompound drawingfisheye viewforce-directed placementhierarchical layout

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (2)

An Exact Method for the Minimum Feedback Arc Set Problem ⋮ Approaches to visualization in bioinformatics: From dendrograms to space explorer

Uses Software

• daVinci

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compiler construction. 5th international conference, CC '94, Edinburgh, GB, April 7--9, 1994. Proceedings
• Graph drawing. DIMACS international workshop, GD '94, Princeton, NJ, USA, October 10-12, 1994. Proceedings
• An algorithm for straight-line drawing of planar graphs
• An algorithm for drawing general undirected graphs
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Crossing Number is NP-Complete
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• Crossing Theory and Hierarchy Mapping
• A forced directed component placement procedure for printed circuit boards

This page was built for publication: Graph layout for applications in compiler construction