The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs.
Shih-Chia ChangLi-Hsuan ChenLing-Ju HungShih-Shun KaoRalf KlasingPublished in: ICS (2020)
Keyphrases
- graph mining
- dense subgraphs
- graph databases
- similarity graph
- graph data
- community discovery
- maximum common subgraph
- frequent subgraphs
- pattern mining
- subgraph isomorphism
- approximation algorithms
- functional modules
- np hard
- graph structures
- biological networks
- subgraph matching
- metric space
- graph classification
- link prediction
- np complete
- subgraph mining
- computational complexity
- worst case
- graph patterns
- connected components
- distance metric
- labeled graphs
- frequent subgraph mining
- edge weights
- community detection
- pattern discovery
- graph theory
- random walk
- undirected graph
- dynamic graph
- graph properties
- link analysis
- vector space
- information theoretic
- special case