q-partitioning of graphs with finite coordination number

DOI10.1088/0305-4470/21/22/001MaRDI QIDQ3035331zbMATH OpenOpenAlexFDO

Authors Yadin Y. Goldschmidt, Pik-Yin Lai

Publication date 1988

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/0305-4470/21/22/001

zbMATH Keywords

simulations3-partitions of random graphsq-partitioning of graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Application of statistical mechanics to combinatorial optimization problems: the chromatic number problem and \(q\)-partitioning of a graph.
• Graph bipartitioning and statistical mechanics
• Application of statistical mechanics to NP-complete problems in combinatorial optimisation
• Number partitioning as a random energy model
• scientific article; zbMATH DE number 910878

Cited in

(6)

• Non-equilibrium dynamics and phase transitions in Potts model and interacting Ehrenfest urn model
• Optimal cooperation and submodularity for computing Potts  partition functions with a large number of states
• Optimized network properties in network growing models
• Phase transitions in optimized network models
• Graph bipartitioning and statistical mechanics
• Application of statistical mechanics to combinatorial optimization problems: the chromatic number problem and \(q\)-partitioning of a graph.

This page was built for publication: q-partitioning of graphs with finite coordination number

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