No. Title Author Year
1 Is It Easier to Count Communities Than Find Them? Rush, Cynthia et al. 2023
2 The Parameterised Complexity of Computing the Maximum Modularity of a Graph Meeks, Kitty et al. 2019
3 Inversions in Split Trees and Conditional Galton-Watson Trees Cai, Xing Shi et al. 2018
4 Modularity of Erdös-Rényi Random Graphs McDiarmid, Colin et al. 2018
5 Permutations in Binary Trees and Split Trees Albert, Michael et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 5

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI