Computing Dense and Sparse Subgraphs of Weakly Closed Graphs.
Tomohiro KoanaChristian KomusiewiczFrank SommerPublished in: CoRR (2020)
Keyphrases
- quasi cliques
- graph mining
- graph databases
- densely connected
- labeled graphs
- subgraph matching
- graph structures
- subgraph isomorphism
- maximum clique
- graph properties
- dense stereo
- graph matching
- connected subgraphs
- query graph
- frequently occurring
- frequent subgraph mining
- reachability queries
- dense optical flow
- graph patterns
- motion field estimation
- high dimensional
- maximum common subgraph
- subgraph mining
- data structure
- dense motion estimation
- dense subgraphs
- topological information
- gaussian graphical models
- helmholtz principle
- social networks
- frequent subgraphs
- graph clustering
- graph data
- graph theoretic
- biological networks
- graph structure
- connected components
- object recognition
- image sequences