scientific article
From MaRDI portal
Publication:3777426
zbMath0637.68009MaRDI QIDQ3777426
No author found.
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitypartitioningcomputational geometryroutingcompactionVerificationplacementassigningLayout designverification. VLSI layout design
Analysis of algorithms and problem complexity (68Q25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Applications of graph theory to circuits and networks (94C15) Algorithms in computer science (68W99) Discrete mathematics in relation to computer science (68Rxx)
Related Items (9)
A parallel algorithm for solving the coloring problem on trapezoid graphs ⋮ Trapezoid graphs and their coloring ⋮ A note on hypergraph decomposition based on extended minimal sets ⋮ A framework for 1-D compaction with forbidden region avoidance ⋮ Maximum \(k\)-covering of weighted transitive graphs with applications ⋮ Balanced block spacing for VLSI layout ⋮ A branch-and-price algorithm for the Steiner tree packing problem. ⋮ In-place algorithms for computing a largest clique in geometric intersection graphs ⋮ Rectilinear paths among rectilinear obstacles
This page was built for publication:
