Login / Signup
The parameterised complexity of computing the maximum modularity of a graph.
Kitty Meeks
Fiona Skerman
Published in:
CoRR (2018)
Keyphrases
</>
random walk
graph structure
graph theoretic
computational complexity
worst case
directed acyclic graph
decision problems
connected components
graph theory
space complexity
homology generators
data mining
causal graph
graph representation
graph partitioning
graph mining
weighted graph
structured data