Graph partitioning

MaRDI QIDQ2889270zbMATH OpenFDO

Authors

Publication date 6 June 2012

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory (05C90)

Cited in

(33)

• Partitioning graphs into complete and empty graphs
• Embedding equality constraints of optimization problems into a quantum annealer
• Multiway \(p\)-spectral graph cuts on Grassmann manifolds
• An overview of graph covering and partitioning
• The influence of partitioning on domain decomposition convergence rates
• Minimum bisection is NP-hard on unit disk graphs
• A reactive self-tuning scheme for multilevel graph partitioning
• On the sum-max graph partitioning problem
• A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas
• General introduction to graph partitioning
• Factorization-Based Graph Repartitionings
• scientific article; zbMATH DE number 5990414 (Why is no real title available?)
• scientific article; zbMATH DE number 6501141 (Why is no real title available?)
• Multi-level spectral graph partitioning method
• Partitioning Planar Graphs
• scientific article; zbMATH DE number 1942408 (Why is no real title available?)
• scientific article; zbMATH DE number 2043366 (Why is no real title available?)
• Partitioning a graph into minimum gap components
• scientific article; zbMATH DE number 7286677 (Why is no real title available?)
• Tree-based coarsening and partitioning of complex networks
• scientific article; zbMATH DE number 4187858 (Why is no real title available?)
• ILP-Based Local Search for Graph Partitioning
• Better Process Mapping and Sparse Quadratic Assignment
• Redistricting optimization with recombination: a local search case study
• Graph partitioning: an updated survey
• Fission: Practical algorithms for computing minimum balanced node separators
• On minimum vertex bisection of random \(d\)-regular graphs
• Finding \(k\)-community structures in special graph classes
• Sparse linear least-squares problems
• Quantum circuit optimization via graph partitioning by quantum annealing
• Coupe: a mesh partitioning platform
• Graph partition into small cliques
• Partitioning multi-edge graphs

This page was built for publication: Graph partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889270)