Pages that link to "Item:Q786031"
From MaRDI portal
The following pages link to The parameterised complexity of computing the maximum modularity of a graph (Q786031):
Displaying 7 items.
- 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)
- (Q5009471) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5874480) (← links)
- Maximum modular graphs (Q6135108) (← links)