A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs
- 1 June 1995
- journal article
- Published by Springer Nature in OR Spectrum
- Vol. 17 (2-3) , 159-172
- https://doi.org/10.1007/bf01719261
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Simple Local Search Problems that are Hard to SolveSIAM Journal on Computing, 1991
- Architecture and programming of a VLIW style programmable video signal processorPublished by Association for Computing Machinery (ACM) ,1991
- Periodic Multiprocessor SchedulingPublished by Springer Nature ,1991
- Periodic multiprocessor schedulingPublished by Springer Nature ,1991
- Combinatorial Algorithms for Integrated Circuit LayoutPublished by Springer Nature ,1990
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- A general-purpose programmable video signal processorIEEE Transactions on Consumer Electronics, 1989
- How easy is local search?Journal of Computer and System Sciences, 1988
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970