An Efficient Heuristic Procedure for Partitioning Graphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A novel partitioning method for block-structured adaptive meshes
- An efficient approach for large scale graph partitioning
- A heuristic method for solving the problem of partitioning graphs with supply and demand
- Simultaneous mesh generation and partitioning for Delaunay meshes
- Evaluating the Kernighan-Lin Heuristic for Hardware/Software Partitioning
- Cuts, cats, and complete graphs
- Parallel finite element simulations of incompressible viscous fluid flow by domain decomposition with Lagrange multipliers
- A multilevel tabu search algorithm for balanced partitioning of unstructured grids
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
- Partitioning methods for satisfiability testing on large formulas
- On sparse matrix orderings in interior point methods
- Engineering branch-and-cut algorithms for the equicut problem
- The geo-graph in practice: creating United States congressional districts from census blocks
- The MIN-cut and vertex separator problem
- Model-based edge clustering for weighted networks with a noise component
- An overview of graph covering and partitioning
- Finding 3-swap-optimal independent sets and dominating sets is hard
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- Reducing Rollbacks Through Partitioning in PCS Parallel Simulation
- Parallel adaptation of general three-dimensional hybrid meshes
- A survey of direct methods for sparse linear systems
- Community detection via an efficient nonconvex optimization approach based on modularity
- A decomposition algorithm for multi-terminal network flows
- A GRASP-Tabu heuristic approach to territory design for pickup and delivery operations for large-scale instances
- A social network based patching scheme for worm containment in cellular networks
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- On using learning automata for fast graph partitioning
- The GST load balancing algorithm for parallel and distributed systems
- Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning.
- Fast local search algorithms for the handicapped persons transportation problem
- Projection approaches to process mining using region-based techniques
- The equipartition polytope. I: Formulations, dimension and basic facets
- Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
- Increasing the attraction area of the global minimum in the binary optimization problem
- A MIMD implementation of a parallel Euler solver for unstructured grids
- On the minimum edge bisection of graph
- On minimum vertex bisection of random \(d\)-regular graphs
- A unified framework of multi-objective cost functions for partitioning unstructured finite element meshes
- scientific article; zbMATH DE number 7310218 (Why is no real title available?)
- A new greedy algorithm for the quadratic assignment problem
- An efficient memetic algorithm for the graph partitioning problem
- A hybrid algorithm for the drilling rig routing problem
- Parallel static and dynamic multi‐constraint graph partitioning
- On the statistical detection of clusters in undirected networks
- Partitioning a reaction–diffusion ecological network for dynamic stability
- Sequential search and its application to vehicle-routing problems
- Reformulated acyclic partitioning for rail-rail containers transshipment
- An efficient local search for the feedback vertex set problem
- Spectral methods for graph bisection problems.
- Online partitioning method for decentralized control of linear switching large-scale systems
- The unconstrained binary quadratic programming problem: a survey
- COMMUNITY DETECTION IN SOCIAL NETWORKS EMPLOYING COMPONENT INDEPENDENCY
- Solving the max-cut problem using eigenvalues
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- On algorithms in the parallel design of logic and layout of circuits with functional blocks
- Semidefinite programming relaxations for the graph partitioning problem
- Randomized local search for the discrete competitive facility location problem
- An effective iterated tabu search for the maximum bisection problem
- Continuous reductions among combinatorial optimization problems
- scientific article; zbMATH DE number 1062852 (Why is no real title available?)
- Language games in investigation of social networks: finding communities and influential agents
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem
- Relaxation-based coarsening for multilevel hypergraph partitioning
- A parallel graph partitioning algorithm for a message-passing multiprocessor
- Face recognition using spectral features
- A class of bounded approximation algorithms for graph partitioning
- Generalizations of Opt P to the polynomial hierarchy
- Orchard algorithm (OA): a new meta-heuristic algorithm for solving discrete and continuous optimization problems
- Scalable module detection for attributed networks with applications to breast cancer
- Evolutionary algorithm and modularity for detecting communities in networks
- Decentralized mining social network communities with agents
- On local search for the generalized graph coloring problem
- A new approach to choosing initial points in local search
- Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
- Automatic symbolic compositional verification by learning assumptions
- A simple approach to sparse clustering
- Exact solution of multicommodity network optimization problems with general step cost functions
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- Leveraging special-purpose hardware for local search heuristics
- Graph coarsening: from scientific computing to machine learning
- Multilayer stochastic block models for community detection in heterogeneous networks
- A HW/SW partitioner for multi-mode multi-task embedded applications
- A branch-and-cut algorithm for the equicut problem
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- An optimal tree search method for the manufacturing systems cell formation problem
- Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient
- Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks
- Uncovering the overlapping community structure of complex networks by maximal cliques
- Randomized algorithms in combinatorial optimization: A survey
- The life span method -- a new variant of local search
- Using domain decomposition to find graph bisectors
- Load-Balancing for Parallel Delaunay Triangulations
- A genetic algorithm for detecting communities in large-scale complex networks
- Finding good approximate vertex and edge partitions is NP-hard
- Density-based clustering of social networks
- AN EFFECTIVE APPROACH FOR DISTRIBUTED PROGRAM ALLOCATION
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Finding optimal hardware/software partitions
- A Matrix Partitioning Interface to PaToH in MATLAB
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)
