The Parameterised Complexity of Computing the Maximum Modularity of a Graph.

Kitty Meeks Fiona Skerman

Published in: IPEC (2018)

Keyphrases

random walk
connected components
graph representation
computational complexity
structured data
graph matching
computational cost
worst case
data mining
directed graph
memory requirements
bipartite graph
graph theory
space complexity
probabilistic model
upper bound
lower bound
directed acyclic graph
graph mining