The Parameterised Complexity of Computing the Maximum Modularity of a Graph.
Kitty MeeksFiona SkermanPublished in: Algorithmica (2020)
Keyphrases
- graph representation
- worst case
- directed graph
- communities in social networks
- graph structure
- data sets
- computational complexity
- polynomial time complexity
- semi supervised
- structured data
- decision problems
- connected components
- graph search
- graph matching
- directed acyclic graph
- graph based algorithm
- graph construction
- graph data
- graph theoretic
- genetic algorithm
- maximum number
- spanning tree
- graph model
- computational cost
- bayesian networks
- database
- random walk
- upper bound
- probabilistic model