The following pages link to (Q5009471):
Displaying 6 items.
- The parameterised complexity of computing the maximum modularity of a graph (Q786031) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- The complexity of modular graph automorphism (Q2706110) (← links)
- (Q4381387) (← links)
- Modularity of Erdős‐Rényi random graphs (Q5120747) (← links)
- Maximum modular graphs (Q6135108) (← links)