scientific article; zbMATH DE number 88981
From MaRDI portal
Publication:4016539
Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Applications of graph theory to circuits and networks (94C15)
Recommendations
- A framework for solving VLSI graph layout problems
- Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges
- VLSI layouts of complete graphs and star graphs
- The VLSI Complexity of Selected Graph Problems
- On the Optimal Layout of Planar Graphs with Fixed Boundary
- Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach
- On a graph partition problem with application to VLSI layout
- A graph-theoretic approach to the IC layout resizing problem
- Graph Bipartization Problem with Applications to Via Minimization in VLSI Design
- On VLSI layouts of the star graph and related networks
Cited in
(6)- Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments
- scientific article; zbMATH DE number 4147519 (Why is no real title available?)
- An area-maximum edge length trade-off for VSLI layout
- Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays
- On VLSI layouts of the star graph and related networks
- A framework for solving VLSI graph layout problems
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 Q4016539)
