Partitioning a graph into minimum gap components
From MaRDI portal
Publication:510915
DOI10.1016/j.endm.2016.10.009zbMath1356.05104OpenAlexW2555427973MaRDI QIDQ510915
Roberto Cordone, Maurizio Bruglieri
Publication date: 14 February 2017
Full work available at URL: http://hdl.handle.net/11311/1003476
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Signed and weighted graphs (05C22)
Related Items
Metaheuristics for the minimum gap graph partitioning problem ⋮ Cardinality constrained connected balanced partitions of trees under different criteria ⋮ Connected graph partitioning with aggregated and non‐aggregated gap objective functions ⋮ On finding connected balanced partitions of trees
Cites Work
This page was built for publication: Partitioning a graph into minimum gap components
