A framework for solving VLSI graph layout problems
From MaRDI portal
Recommendations
- On a graph partition problem with application to VLSI layout
- Solving Undirected Graph Problems on VLSI
- scientific article; zbMATH DE number 88981
- A graph-theoretic approach to the IC layout resizing problem
- VLSI layouts of complete graphs and star graphs
- scientific article; zbMATH DE number 139786
- The VLSI Complexity of Selected Graph Problems
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- scientific article; zbMATH DE number 3914339
Cites work
- A network of microprocessors to execute reduction languages, part II
- An efficient heuristic cluster algorithm for tearing large-scale networks
- An Efficient Heuristic Procedure for Partitioning Graphs
- Efficient detection of determinacy races in cilk programs
- Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
- scientific article; zbMATH DE number 3648730 (Why is no real title available?)
- scientific article; zbMATH DE number 3858396 (Why is no real title available?)
- scientific article; zbMATH DE number 3915623 (Why is no real title available?)
- scientific article; zbMATH DE number 3936520 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3428547 (Why is no real title available?)
- New lower bound techniques for VLSI
- On driving many long wires in a VLSI layout
- On-Line Algorithms for Path Selection in a Nonblocking Network
- Parallel algorithms for the circuit value update problem
- The Compilation of Regular Expressions into Integrated Circuits
- The complexity of minimizing wire lengths in VLSI layouts
- Universality considerations in VLSI circuits
- Wafer-Scale Integration of Systolic Arrays
Cited in
(only showing first 100 items - show all)- Exact wirelength of hypercubes on a grid
- An assignment algorithm with applications to integrated circuit layout
- Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs
- Global wire routing in two-dimensional arrays
- Splitting necklaces
- Graph graphics: Theory and practice
- On embedding graphs in trees
- A compact layout for the three-dimensional tree of meshes
- The complexity of minimizing wire lengths in VLSI layouts
- Real-time emulations of bounded-degree networks
- Representations of graphs and networks (coding, layouts and embeddings)
- Paths, flows, and VLSI-layout. Proceedings of a meeting held from June 20 to July 1, 1988, at the University of Bonn, Germany
- Product-shuffle networks: Toward reconciling shuffles and butterflies
- Modeling hypergraphs by graphs with the same mincut properties
- Advances in the theory and practice of graph drawing
- A lower bound for area-universal graphs
- Optimum embedding of complete graphs in books
- An experimental evaluation of local search heuristics for graph partitioning
- New results on drawing angle graphs
- Crossing-number critical graphs have bounded path-width
- A new lower bound for the bipartite crossing number with applications
- Bounding the bandwidths for graphs
- Algorithms for the fixed linear crossing number problem
- Alternative evaluation functions for the cyclic bandwidth sum problem
- Heuristics for the constrained incremental graph drawing problem
- The \(S\)-\textsc{labeling} problem: an algorithmic tour
- The crossing number of locally twisted cubes \(L T Q_n\)
- General variable neighborhood search for computing graph separators
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
- Representing graph families with edge grammars
- On the complexity of planar Boolean circuits
- Which crossing number is it anyway?
- Implementing shared memory on mesh-connected computers and on the fat-tree
- Crossing number, pair-crossing number, and expansion
- Vertex ordering and partitioning problems for random spatial graphs.
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs
- Characterization of the congestion lemma on layout computation
- A note on the crossing number of the cone of a graph
- Embedding algorithm of spined cube into grid structure and its wirelength computation
- Non-crossing shortest paths in undirected unweighted planar graphs in linear time
- A general variable neighborhood search for the cyclic antibandwidth problem
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
- Exact crossing number parameterized by vertex cover
- Rotation and crossing numbers for join products
- Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments
- Tabu search for min-max edge crossing in graphs
- Separator-based graph embedding into multidimensional grids with small edge-congestion
- Self-adjusting grid networks to minimize expected path length
- Balanced partitions of trees and applications
- Balanced tree partition problems with virtual nodes
- Crossing number additivity over edge cuts
- An analysis of some linear graph layout heuristics
- On the crossing numbers of loop networks and generalized Petersen graphs
- Optimal Cheeger cuts and bisections of random geometric graphs
- A variable depth neighborhood search algorithm for the min-max arc crossing problem
- DESIGN OF A PARALLEL INTERCONNECT BASED ON COMMUNICATION PATTERN CONSIDERATIONS
- An upper bound for the crossing number of augmented cubes
- Self-adjusting grid networks to minimize expected path length
- Optimal embedding of locally twisted cubes into grids
- A maximum weight clique algorithm for dense circle graphs with many shared endpoints
- scientific article; zbMATH DE number 2185598 (Why is no real title available?)
- scientific article; zbMATH DE number 4132095 (Why is no real title available?)
- Square-root rule of two-dimensional bandwidth problem
- The crossing number of chordal ring networks
- Sparsest-cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
- Tabu search for the cyclic bandwidth problem
- scientific article; zbMATH DE number 4147519 (Why is no real title available?)
- Embeddings of circulant networks
- MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING
- Crossing and Weighted Crossing Number of Near-Planar Graphs
- UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS
- The Crossing Number of Graphs: Theory and Computation
- scientific article; zbMATH DE number 3914339 (Why is no real title available?)
- scientific article; zbMATH DE number 3950392 (Why is no real title available?)
- Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées
- Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays
- Fast balanced partitioning is hard even on grids and trees
- scientific article; zbMATH DE number 88981 (Why is no real title available?)
- scientific article; zbMATH DE number 139786 (Why is no real title available?)
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- An approach to emulating separable graphs
- Congestion optimale du plongement de l’hypercube H (n) dans la chaîne P(2ⁿ)
- On VLSI layouts of the star graph and related networks
- Orthogonal drawings and crossing numbers of the Kronecker product of two cycles
- Approximation algorithms for Euler genus and related problems
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- The bisection width of cubic graphs
- Preprocessing Steiner problems from VLSI layout
- scientific article; zbMATH DE number 833244 (Why is no real title available?)
- On the parameterized complexity of computing balanced partitions in graphs
- Graph layout problems
- New abilities and limitations of spectral graph bisection
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
- Crossing number and weighted crossing number of near-planar graphs
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
- Min-max-boundary domain decomposition
- Cyclic bandwidth sum of graphs
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
This page was built for publication: A framework for solving VLSI graph layout problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796306)
