scientific article; zbMATH DE number 802995
From MaRDI portal
Publication:4850027
zbMath0840.68060MaRDI QIDQ4850027
Publication date: 5 October 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Parallel algorithms in computer science (68W10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Applications of graph theory to circuits and networks (94C15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Related Items (15)
Finding geometric representations of apex graphs is NP-hard ⋮ A simulated evolution-based solution of the cover problem ⋮ Optimal algorithms for some polygon enclosure problems for VLSI layout analysis ⋮ A Faster Algorithm for Maximum Induced Matchings on Circle Graphs ⋮ Formation of train routes in a station ⋮ Parameterized domination in circle graphs ⋮ A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints ⋮ Local properties of geometric graphs ⋮ Local search with a SAT oracle for combinatorial optimization ⋮ A linear algorithm for compact box-drawings of trees ⋮ A simulated evolution-based solution of the placement problem ⋮ Distance in stratified graphs ⋮ Unnamed Item ⋮ Congestion estimation for hexagonal routing ⋮ A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation.
This page was built for publication:
