Computing Dense and Sparse Subgraphs of Weakly Closed Graphs.
Tomohiro KoanaChristian KomusiewiczFrank SommerPublished in: Algorithmica (2023)
Keyphrases
- quasi cliques
- graph mining
- graph databases
- densely connected
- subgraph matching
- subgraph isomorphism
- labeled graphs
- graph properties
- graph structures
- high dimensional
- maximum common subgraph
- dense stereo
- subgraph mining
- reachability queries
- dense optical flow
- connected subgraphs
- maximum clique
- undirected graph
- data structure
- graph data
- topological information
- graph theoretic
- frequent subgraphs
- graph patterns
- biological networks
- frequent subgraph mining
- frequently occurring
- directed graph
- sparse data
- query graph
- graph matching
- gaussian graphical models
- graph clustering