An Efficient Heuristic Procedure for Partitioning Graphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Optimal block-tridiagonalization of matrices for coherent charge transport
- An effective local search for the maximum clique problem
- Randomized algorithms in combinatorial optimization: A survey
- Grouping of parts and components in flexible manufacturing systems
- A decomposition algorithm for multi-terminal network flows
- A polynomial characterization of some graph partitioning problems
- How easy is local search?
- A parallel graph partitioning algorithm for a message-passing multiprocessor
- Continuous reductions among combinatorial optimization problems
- A new approach to choosing initial points in local search
- 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
- Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning.
- Parallel three-dimensional direct simulation Monte Carlo method and its applications.
- Spectral methods for graph bisection problems.
- Dynamic load balancing in computational mechanics
- Generating irregular partitionable data structures
- Algorithms for graph partitioning problems by means of eigenspace relaxations
- Local search algorithms for the multiprocessor flow shop scheduling problem
- Identifying sets of key players in a social network
- The GST load balancing algorithm for parallel and distributed systems
- Solution of large weighted equicut problems
- On the statistical detection of clusters in undirected networks
- Weighted modularity optimization for crisp and fuzzy community detection in large-scale networks
- Evolutionary algorithm and modularity for detecting communities in networks
- The Boolean quadratic programming problem with generalized upper bound constraints
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- An effective iterated tabu search for the maximum bisection problem
- Exact computational solution of modularity density maximization by effective column generation
- A simple approach to sparse clustering
- Fuzzy random walkers with second order bounds: an asymmetric analysis
- Moving clusters within a memetic algorithm for graph partitioning
- A novel partitioning method for block-structured adaptive meshes
- Social network community detection using agglomerative spectral clustering
- A novel probabilistic clustering model for heterogeneous networks
- Reformulated acyclic partitioning for rail-rail containers transshipment
- An efficient local search for the feedback vertex set problem
- Online partitioning method for decentralized control of linear switching large-scale systems
- Efficient modularity density heuristics for large graphs
- Extended neighborhood: Definition and characterization
- Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient
- Two-stage algorithm using influence coefficient for detecting the hierarchical, non-overlapping and overlapping community structure
- Uncovering the overlapping community structure of complex networks by maximal cliques
- Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks
- Reduction techniques for network validation in systems biology
- A practical propagation path identification scheme for quality-related faults based on nonlinear dynamic latent variable model and partitioned Bayesian network
- Efficient semidefinite branch-and-cut for MAP-MRF inference
- 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
- Simultaneous mesh generation and partitioning for Delaunay meshes
- Graph multidimensional scaling with self-organizing maps
- On local search for the generalized graph coloring problem
- 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
- Beyond good partition shapes: an analysis of diffusive graph partitioning
- A new greedy algorithm for the quadratic assignment problem
- Linear and quadratic programming approaches for the general graph partitioning problem
- Semidefinite programming relaxations for the graph partitioning problem
- A GRASP-Tabu heuristic approach to territory design for pickup and delivery operations for large-scale instances
- Stochastic block models are a discrete surface tension
- Optimized quantum circuit partitioning
- Overlapping communities and roles in networks with node attributes: probabilistic graphical modeling, Bayesian formulation and variational inference
This page was built for publication: An Efficient Heuristic Procedure for Partitioning Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4100093)
