Scientific discovery in connectomics relies on network null models. The prominence of network features is conventionally evaluated against null distributions estimated using randomized networks.
We introduce a new algorithm MaxCliqueWeight for identifying a maximum weight clique in a weighted graph, and its variant MaxCliqueDynWeight with dynamically varying bounds. This algorithm uses an ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results