Bipartition of small-world networks
We studied the bipartitioning of small-world networks. We generated small-world networks from a square lattice via a modified Watts- Strogatz algorithm. We compared several partitioning algorithms, such as Monte Carlo with Kawasaki dynamics and Simulated Annealing, Extremal Optimization and Multilev...
| Autor principal: | |
|---|---|
| Formato: | masterThesis |
| Idioma: | eng |
| Publicado em: |
2021
|
| Texto completo: | http://hdl.handle.net/10773/27755 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/27755 |