An Efficient Heuristic Procedure for Partitioning Graphs
From MaRDI portal
Publication:4100093
DOI10.1002/j.1538-7305.1970.tb01770.xzbMath0333.05001WikidataQ56431136 ScholiaQ56431136MaRDI QIDQ4100093
No author found.
Publication date: 1970
Published in: Bell System Technical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/j.1538-7305.1970.tb01770.x
Related Items
Unnamed Item, Local bipartite turán graphs and graph partitioning, COMPILE-TIME ANALYSIS AND OPTIMIZATION OF EXPLICITLY PARALLEL PROGRAMS*, Branch-and-bound techniques for the maximum planar subgraph problem∗, The decomposition of a communication network considering traffic demand interrelations, Autocorrelation coefficient for the graph bipartitioning problem, Efficient algorithms for single- and two-layer linear placement of parallel graphs, Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem, Generalizations of Opt P to the polynomial hierarchy, Nested annealing: A provable improvement to simulated annealing, Maximum concurrent flows and minimum cuts, Finding good approximate vertex and edge partitions is NP-hard, New \(({\Delta{}}, D)\) graphs discovered by heuristic search, Paroids: A canonical format for combinatorial optimization, A Lagrangean heuristic for the maximal covering location problem, The life span method -- a new variant of local search, Path optimization for graph partitioning problems, The node capacitated graph partitioning problem: A computational study, An optimal tree search method for the manufacturing systems cell formation problem, Optimal cutting directions and rectangle orientation algorithm, Exact solution of multicommodity network optimization problems with general step cost functions, A fuzzy clustering algorithm for graph bisection, A computational study of graph partitioning, New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation, Genetic algorithm based heuristics for the mapping problem, On the magnetisation of the ground states in two dimensional Ising spin glasses, A linear programming approach to reasoning about probabilities, Cluster differences scaling with a within-clusters loss component and a fuzzy successive approximation strategy to avoid local minima, Partitioning of sequentially ordered systems using linear programming, Logical and layout structures of documents, Using domain decomposition to find graph bisectors, A branch-and-cut algorithm for the equicut problem, Minimum-perimeter domain assignment, Partitioning mathematical programs for parallel solution, A new extension of local search applied to the Dial-A-Ride problem, Dynamic load balancing in computational mechanics, Generating irregular partitionable data structures, Algorithms for graph partitioning problems by means of eigenspace relaxations, Paroid search: Generic local combinatorial optimization, Exploiting special structure in a primal-dual path-following algorithm, Greedy randomized adaptive search procedures, Partitioning graphs on message-passing machines by pairwise mincut, Some new classes of facets for the equicut polytope, Solving the max-cut problem using eigenvalues, A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs, A new approach to minimising the frontwidth in finite element calculations, A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms, Combining simulated annealing with local search heuristics, Tabu search for graph partitioning, On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint, Parallel local search, Test driving three 1995 genetic algorithms: New test functions and geometric matching, Semidefinite programming relaxations for the graph partitioning problem, Genetic search algorithms and their randomized operators, The partition problem, Multi-way graph partition by stochastic probe, The optimal partitioning of networks, On algorithms in the parallel design of logic and layout of circuits with functional blocks, Unnamed Item, Unnamed Item, Unnamed Item
