Graph bipartitioning and statistical mechanics
From MaRDI portal
Publication:3757938
Recommendations
- Bipartitioning of random graphs of fixed extensive valence
- Application of statistical mechanics to NP-complete problems in combinatorial optimisation
- q-partitioning of graphs with finite coordination number
- Bipartitioning of directed and mixed random graphs
- The Metropolis algorithm for graph bisection
Cited in
(8)- Neutrality in fitness landscapes.
- A numerical study of sparse random matrices
- On Dependency Graphs and the Lattice Gas
- q-partitioning of graphs with finite coordination number
- Graph weights arising from statistical mechanics
- Statistical mechanics methods and phase transitions in optimization problems
- Bipartitioning of directed and mixed random graphs
- Bipartitioning of random graphs of fixed extensive valence
This page was built for publication: Graph bipartitioning and statistical mechanics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757938)