Orthogonal drawings of graphs for the automation of VLSI circuit design
From MaRDI portal
Publication:1966107
DOI10.1007/BF02948786zbMath0945.68199OpenAlexW1976203742MaRDI QIDQ1966107
Publication date: 1999
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02948786
Graph theory (including graph drawing) in computer science (68R10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The efficient recognition on net-extensibility of graphs
- A framework for solving VLSI graph layout problems
- General theoretical results on rectilinear embeddability of graphs
- A characterization of planar graphs by Trémaux orders
- A new approach to the linearity of testing planarity of graphs
- Embedding planar graphs in four pages
- Theoretical results on at most 1-bend embeddability of graphs
- A note on Lerda and Majorani's minimum crossing algorithm
- Applications of algebraic topology. Graphs and networks. The Picard- Lefschetz theory and Feynman integrals
- Some combinatorial optimization problems arising from VLSI circuit design
- At most single-bend embeddings of cubic graphs
- A graph partition problem
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- Boolean approaches to graph embeddings related to VLSI
- Transportation networks: Old and new
- On Boolean characterizations of planarity and planar embeddings of graphs
- An algorithm for connecting n points with a minimum number of crossings
- Einbettung von Streckenkomplexen in die Ebene
- \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs
- Normalformen planarer Graphen. I
- Normalformen planarer Graphen. II
- A structural characterization of planar combinatorial graphs
- On the Optimal Layout of Planar Graphs with Fixed Boundary
- A Class Of Abelian Groups
- Planar embedding: linear-time algorithms for vertex placement and edge orderings
- Cubic graphs with crossing number two
- Boolean planarity characterization of graphs
- A Separator Theorem for Planar Graphs
- Embedding Graphs in the Plane—Algorithmic Aspects
- Applications of a Planar Separator Theorem
- Preuve Algebrique Du Critere De Planarite De Wu-Liu
- A Depth-First-Search Characterization of Planarity
- Optimal Search in Planar Subdivisions
- An Improved Algorithm for Testing the Planarity of a Graph
- Efficient Planarity Testing
- A Simple Planarity Criterion
- Note on Hopcroft and Tarjan's Planarity Algorithm
- Mathematical models for the circuit layout problem
- Thickness of graphs with degree constrained vertices
- Planar, coplanar, and totally planar n-port networks
- Boolean approach to planar embeddings of a graph
- Non-Separable and Planar Graphs
- Hierarchical planarity testing algorithms
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- A graph-theoretic via minimization algorithm for two-layer printed circuit boards
- Planar Graphs
- Dividing a Graph into Triconnected Components
- On the net-embeddability of graphs
- PLANAR GRAPHS AND RELATED TOPICS
- Inequalities involving the genus of a graph and its thicknesses
- The Thickness of the Complete Graph
- Die dicke des n-dimensionalen Würfel-graphen
- A class of thickness-minimal graphs
- Thickness and connectivity in graphs
- Toward a theory of crossing numbers
- A Characterization of Planar Oriented Graphs
- The complexity of theorem-proving procedures
- A Proper Model for Testing the Planarity of Electrical Circuits
- How to Draw a Graph
- On the thickness of the complete graph
- A Theorem on Planar Graphs
This page was built for publication: Orthogonal drawings of graphs for the automation of VLSI circuit design
