Pages that link to "Item:Q796306"

The following pages link to A framework for solving VLSI graph layout problems (Q796306):

Displaying 50 items.

• The crossing number of chordal ring networks (Q313472) (← links)
• Tabu search for the cyclic bandwidth problem (Q337475) (← links)
• Embeddings of circulant networks (Q358657) (← links)
• Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength (Q411854) (← links)
• Orthogonal drawings and crossing numbers of the Kronecker product of two cycles (Q433407) (← links)
• On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
• A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs (Q528766) (← links)
• Crossing number and weighted crossing number of near-planar graphs (Q548655) (← links)
• Theory and application of width bounded geometric separators (Q632801) (← links)
• Optimal cache-oblivious mesh layouts (Q633762) (← links)
• Two models of two-dimensional bandwidth problems (Q656608) (← links)
• New graph decompositions with applications to emulations (Q675853) (← links)
• The MIN-cut and vertex separator problem (Q683339) (← links)
• The treewidth of line graphs (Q723884) (← links)
• An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
• A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789) (← links)
• Complexities of layouts in three-dimensional VLSI circuits (Q753802) (← links)
• Lattice bandwidth of random graphs (Q810061) (← links)
• \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
• A branch-and-cut approach to the crossing number problem (Q951113) (← links)
• Area-time tradeoffs for universal VLSI circuits (Q959803) (← links)
• The crossing number of \(K_{1,m,n}\) (Q998333) (← links)
• Exact wirelength of hypercubes on a grid (Q1028121) (← links)
• Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs (Q1084869) (← links)
• Global wire routing in two-dimensional arrays (Q1097238) (← links)
• Splitting necklaces (Q1097280) (← links)
• Graph graphics: Theory and practice (Q1103411) (← links)
• On embedding graphs in trees (Q1103631) (← links)
• A compact layout for the three-dimensional tree of meshes (Q1105621) (← links)
• The complexity of minimizing wire lengths in VLSI layouts (Q1107990) (← links)
• Real-time emulations of bounded-degree networks (Q1128816) (← links)
• Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
• Product-shuffle networks: Toward reconciling shuffles and butterflies (Q1199448) (← links)
• Modeling hypergraphs by graphs with the same mincut properties (Q1209979) (← links)
• Advances in the theory and practice of graph drawing (Q1285778) (← links)
• A lower bound for area-universal graphs (Q1332765) (← links)
• Optimum embedding of complete graphs in books (Q1379820) (← links)
• An experimental evaluation of local search heuristics for graph partitioning (Q1382773) (← links)
• New results on drawing angle graphs (Q1384188) (← links)
• Crossing-number critical graphs have bounded path-width (Q1400969) (← links)
• A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
• Bounding the bandwidths for graphs (Q1583541) (← links)
• Algorithms for the fixed linear crossing number problem (Q1613416) (← links)
• Alternative evaluation functions for the cyclic bandwidth sum problem (Q1631512) (← links)
• Heuristics for the constrained incremental graph drawing problem (Q1634310) (← links)
• The \(S\)-\textsc{labeling} problem: an algorithmic tour (Q1647835) (← links)
• The crossing number of locally twisted cubes \(L T Q_n\) (Q1671371) (← links)
• General variable neighborhood search for computing graph separators (Q1677293) (← links)
• A hybrid breakout local search and reinforcement learning approach to the vertex separator problem (Q1753627) (← links)