scientific article; zbMATH DE number 7286677
From MaRDI portal
Publication:5140710
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- ILP-Based Local Search for Graph Partitioning
- Local metaheuristics and graph partitioning
- Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring
- An experimental evaluation of local search heuristics for graph partitioning
- Graph partitioning using linear and semidefinite programming
- Linear and quadratic programming approaches for the general graph partitioning problem
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization
- scientific article; zbMATH DE number 5761786
- A Copositive Programming Approach to Graph Partitioning
- Tabu search for graph partitioning
Cites work
- A combined evolutionary search and multilevel optimisation approach to graph-partitioning
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- An \(\mathcal{O}(n^4)\) time algorithm to compute the bisection width of solid grid graphs
- An Automatic Method of Solving Discrete Programming Problems
- An Efficient Heuristic Procedure for Partitioning Graphs
- An efficient memetic algorithm for the graph partitioning problem
- An exact algorithm for graph partitioning
- Better Bounds for Graph Bisection
- Distributed Evolutionary Graph Partitioning
- Engineering multilevel graph partitioning algorithms
- Exact combinatorial branch-and-bound for graph bisection
- Finding good approximate vertex and edge partitions is NP-hard
- Finding optimal solutions to the graph partitioning problem with heuristic search
- Graph partitioning
- Graph partitioning using linear and semidefinite programming
- scientific article; zbMATH DE number 1875431 (Why is no real title available?)
- Multicommodity flow approximation used for exact graph partitioning
- Nested Dissection of a Regular Finite Element Mesh
- Recent directions in netlist partitioning: a survey
- Solving Graph Bisection Problems with Semidefinite Programming
- Spectral partitioning with multiple eigenvectors
- The node capacitated graph partitioning problem: A computational study
- The University of Florida sparse matrix collection
Cited in
(6)- An experimental evaluation of local search heuristics for graph partitioning
- Lock-gain based graph partitioning
- Local metaheuristics and graph partitioning
- scientific article; zbMATH DE number 7084713 (Why is no real title available?)
- ILP-Based Local Search for Graph Partitioning
- Parallel unconstrained local search for partitioning irregular graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140710)
