Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria

DOI10.1002/NET.21661zbMath1386.05156OpenAlexW2182662656MaRDI QIDQ4638584

Andrea Scozzari, Federica Ricca, Justo Puerto, Isabella Lari

Publication date: 27 April 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21661

zbMATH Keywords

range criteriontree partitioninguniform partitionsflat costsmin-max criterion\(p\)-centered partitionscapacitated partitionsexactly uniform 2-centered partitionmin-sum criterion

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

An overview of graph covering and partitioning ⋮ Metaheuristics for the minimum gap graph partitioning problem ⋮ Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows ⋮ Algorithms for uniform centered partitions of trees ⋮ Uniform and most uniform partitions of trees ⋮ On finding connected balanced partitions of trees ⋮ Reconfiguration of connected graph partitions via recombination ⋮ Reconfiguration of connected graph partitions via recombination

This page was built for publication: Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria