Analyzing clustering and partitioning problems in selected VLSI models

DOI10.1007/s00224-020-09989-2zbMath1503.68217OpenAlexW3080744988MaRDI QIDQ2032285

Z. Donovan, K. Subramani and Vahan Mkrtchyan, Vahan V. Mkrtchyan

Publication date: 11 June 2021

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-020-09989-2

zbMATH Keywords

VLSI designdelay minimizationdisjoint clustering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computer science aspects of computer-aided design (68U07) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact exponential algorithms.
• A parallel algorithm for bisection width in trees
• Clustering without replication in combinatorial circuits
• Algorithms and Data Structures for External Memory
• How to Pack Directed Acyclic Graphs into Small Blocks
• Algorithms and Theory of Computation Handbook, Volume 2
• Parameterized Algorithms
• Module Clustering to Minimize Delay in Digital Networks
• Spectral Theory and Analysis

This page was built for publication: Analyzing clustering and partitioning problems in selected VLSI models