Disjoint clustering in combinatorial circuits

DOI10.1007/978-3-030-25005-8_17MaRDI QIDQ2301744zbMATH OpenOpenAlexFDO

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

Publication date 25 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-25005-8_17

Mathematics Subject Classification ID

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

Recommendations

• Clustering without replication in combinatorial circuits
• Analyzing clustering and partitioning problems in selected VLSI models
• On clustering without replication in combinatorial circuits
• scientific article; zbMATH DE number 956793
• Solving VLSI physical design problems on a vector machine

Cited in

(4)

• How to pack directed acyclic graphs into small blocks
• Analyzing clustering and partitioning problems in selected VLSI models
• Clustering without replication in combinatorial circuits
• On clustering without replication in combinatorial circuits

This page was built for publication: Disjoint clustering in combinatorial circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301744)