Universality considerations in VLSI circuits
From MaRDI portal
Publication:3904539
DOI10.1109/TC.1981.6312176zbMath0455.94046OpenAlexW1989650529WikidataQ59410434 ScholiaQ59410434MaRDI QIDQ3904539
Publication date: 1981
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1981.6312176
Related Items
A topology-shape-metrics framework for ortho-radial graph drawing, Area-efficient algorithms for upward straight-line tree drawings, An annotated review on graph drawing and its applications, Computing maximum matchings in temporal graphs, Algorithmic aspects of secure domination in unit disk graphs, Orthogonal layout with optimal face complexity, A special planar satisfiability problem and a consequence of its NP- completeness, Finding small simple cycle separators for 2-connected planar graphs, Proximity drawings in polynomial area and volume, Euclidean movement minimization, The complexity of induced minors and related problems, Optimal three-dimensional layouts of complete binary trees, Drawing graphs on rectangular grids, A compact layout for the three-dimensional tree of meshes, The complexity of minimizing wire lengths in VLSI layouts, Orthogeodesic point-set embedding of trees, 1-extendability of independent sets, Complexity of edge monitoring on some graph classes, The realization problem for Euclidean minimum spanning trees is NP-hard, Fan-crossing free graphs and their relationship to other beyond-planar graphs, A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid, Universal graphs and induced-universal graphs, Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs, Linear area upward drawings of AVL trees, New results on drawing angle graphs, Algorithms for area-efficient orthogonal drawing, Closest pair and the post office problem for stochastic points, Area efficient methods to increase the reliability of combinatorial circuits, The complexity of weighted counting for acyclic conjunctive queries, On the computational complexity of Roman\(\{2\}\)-domination in grid graphs, Establishing herd immunity is hard even in simple geometric networks, Algorithms and complexity for geodetic sets on partial grids, Tree drawings revisited, Untangling planar curves, Sparse universal graphs for planarity, Drawing a tree as a minimum spanning tree approximation, Unnamed Item, Independent sets in Line of Sight networks, Orthogonal drawings and crossing numbers of the Kronecker product of two cycles, Finding Large Independent Sets in Line of Sight Networks, Expansion of layouts of complete binary trees into grids, Liar's domination in unit disk graphs, The planar \(k\)-means problem is NP-hard, Secure connected domination and secure total domination in unit disk graphs and rectangle graphs, Unnamed Item, SHUFFLE-RING: A NEW CONSTANT-DEGREE NETWORK, Multilayer grid embeddings for VLSI, A lower bound on the area of permutation layouts, Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity, Unit disk graphs, A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio, Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area, New graph decompositions with applications to emulations, Constructing compact rectilinear planar layouts using canonical representation of planar graphs, A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks, Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements, Not all planar digraphs have small cycle separators, Constrained \(k\)-center and movement to independence, An experimental comparison of four graph drawing algorithms., Vertex-edge domination in unit disk graphs, Unnamed Item, Square-Orthogonal Drawing with Few Bends per Edge, LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs, Perfect Storage Representations for Families of Data Structures, 1-extendability of independent sets, Power consumption in packet radio networks, Universal slope sets for upward planar drawings, The Planar k-Means Problem is NP-Hard, Universal slope sets for upward planar drawings, Tree Drawings on the Hexagonal Grid, A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs, Improved Guarantees for Vertex Sparsification in Planar Graphs, Maximum box problem on stochastic points, Representing graph families with edge grammars, Drawing graphs as spanners, Unnamed Item, Minimum Total Node Interference in Wireless Sensor Networks, Capacitated discrete unit disk cover, Unnamed Item, Unnamed Item, Fixed edge-length graph drawing is NP-hard, Efficient Algorithms for Ortho-Radial Graph Drawing., Grid straight-line embeddings of trees with a minimum number of bends per path, Small area drawings of outerplanar graphs, A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation, Strictly-upward drawings of ordered search trees, On the two-dimensional orthogonal drawing of series-parallel graphs, Finding Paths in Grids with Forbidden Transitions, A result on k-valent graphs and its application to a graph embedding problem, Bounds on path connectivity, On sum coloring and sum multi-coloring for restricted families of graphs, Unnamed Item, Advances in the theory and practice of graph drawing, Power consumption in packet radio networks, How to draw a clustered tree, A framework for solving VLSI graph layout problems, Separator-based graph embedding into multidimensional grids with small edge-congestion, Improved Upper and Lower Bounds for LR Drawings of Binary Trees, Algorithms for drawing binary trees in the plane., How to draw a planar graph on a grid, Optimizing area and aspect ratio in straight-line orthogonal tree drawings, New lower bound techniques for VLSI, The maximum clique problem in multiple interval graphs, Dual power assignment optimization and fault tolerance in WSNs
