Clustering without replication in combinatorial circuits
From MaRDI portal
Publication:2424822
DOI10.1007/s10878-019-00394-1zbMath1426.90214OpenAlexW2916581605MaRDI QIDQ2424822
Z. Donovan, Gregory Gutin, K. Subramani and Vahan Mkrtchyan, Vahan V. Mkrtchyan
Publication date: 25 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00394-1
Related Items (2)
How to pack directed acyclic graphs into small blocks ⋮ Analyzing clustering and partitioning problems in selected VLSI models
Cites Work
- Unnamed Item
- Unnamed Item
- Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT
- A parallel algorithm for bisection width in trees
- On Clustering Without Replication in Combinatorial Circuits
- Module Clustering to Minimize Delay in Digital Networks
- Spectral Theory and Analysis
This page was built for publication: Clustering without replication in combinatorial circuits