An efficient heuristic cluster algorithm for tearing large-scale networks
From MaRDI portal
Publication:4145276
DOI10.1109/TCS.1977.1084298zbMath0368.94028OpenAlexW2143697374MaRDI QIDQ4145276
Li-Kuan Chen, Leon O. Chua, Alberto L. Sangiovanni-Vincentelli
Publication date: 1977
Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tcs.1977.1084298
Related Items (7)
Heuristics for laying out information graphs ⋮ Spiking neural network dynamic system modeling for computation of quantum annealing and its convergence analysis ⋮ Analog circuit optimization on basis of control theory approach ⋮ The decomposition of a communication network considering traffic demand interrelations ⋮ Parallel computations in linear algebra. II ⋮ Characteristics study of an electronic systems design strategy ⋮ A framework for solving VLSI graph layout problems
This page was built for publication: An efficient heuristic cluster algorithm for tearing large-scale networks
