scientific article; zbMATH DE number 7286677
DOI10.4230/LIPIcs.SEA.2018.4zbMath1493.68269arXiv1802.07144MaRDI QIDQ5140710
Alexander Noe, Christian Schulz, Alexandra Henzinger
Publication date: 16 December 2020
Full work available at URL: https://arxiv.org/abs/1802.07144
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient memetic algorithm for the graph partitioning problem
- Finding good approximate vertex and edge partitions is NP-hard
- Spectral partitioning with multiple eigenvectors
- The node capacitated graph partitioning problem: A computational study
- Graph partitioning using linear and semidefinite programming
- A combined evolutionary search and multilevel optimisation approach to graph-partitioning
- An exact algorithm for graph partitioning
- Finding optimal solutions to the graph partitioning problem with heuristic search
- Better Bounds for Graph Bisection
- The university of Florida sparse matrix collection
- An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
- Engineering Multilevel Graph Partitioning Algorithms
- Recent directions in netlist partitioning: a survey
- An Automatic Method of Solving Discrete Programming Problems
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Solving Graph Bisection Problems with Semidefinite Programming
- Distributed Evolutionary Graph Partitioning
- Exact Combinatorial Branch-and-Bound for Graph Bisection
- Nested Dissection of a Regular Finite Element Mesh
- Algorithms - ESA 2003
This page was built for publication:
