1.
J Anim Ecol
; 88(5): 804-807, 2019 05.
Artigo
em Inglês
| MEDLINE
| ID: mdl-30874298
RESUMO
To fairly compare the nestedness of ecological networks, a network's observed nestedness can be divided by its maximum nestedness. The authors show that a greedy algorithm does not find networks' maximum nestedness values. Simulated annealing achieved much better results, laying the foundation for future development of even more sophisticated algorithms.