On Clustering Without Replication in Combinatorial Circuits

DOI10.1007/978-3-319-26626-8_25zbMath1478.94153OpenAlexW2399985362MaRDI QIDQ3467855

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

Publication date: 5 February 2016

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_25

zbMATH Keywords

computational complexityapproximationNP-completenessinapproximabilityclustering without replication

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analytic circuit theory (94C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Applications of graph theory to circuits and networks (94C15) Approximation algorithms (68W25)

Related Items (2)

Clustering without replication in combinatorial circuits ⋮ How to pack directed acyclic graphs into small blocks

Cites Work

• Module Clustering to Minimize Delay in Digital Networks
• Unnamed Item
• Unnamed Item

This page was built for publication: On Clustering Without Replication in Combinatorial Circuits