A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs

DOI10.1007/BF01719261zbMATH Open0842.90117MaRDI QIDQ1909003FDOQ1909003

Authors: E. A. de Kock, E. Aarts, G. Essink, R. E. J. Jansen, J. Korst 

Publication date: 7 March 1996

Published in: OR Spektrum (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1391398
• A genetic algorithm for graph partitioning
• An experimental evaluation of local search heuristics for graph partitioning
• scientific article; zbMATH DE number 1488098

zbMATH Keywords

local searchschedulingpartitioningdelay managementmapping problemreal time-video signal processingrecursive bipartitioning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites Work

• An Efficient Heuristic Procedure for Partitioning Graphs
• How easy is local search?
• Simple Local Search Problems that are Hard to Solve
• Title not available (Why is that?)
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
• An experimental study of variable depth search algorithms for the quadratic assignment problem
• Title not available (Why is that?)

This page was built for publication: A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs

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