Computing Dense and Sparse Subgraphs of Weakly Closed Graphs.
Tomohiro KoanaChristian KomusiewiczFrank SommerPublished in: ISAAC (2020)
Keyphrases
- quasi cliques
- graph mining
- graph databases
- densely connected
- subgraph isomorphism
- graph properties
- reachability queries
- subgraph matching
- graph data
- high dimensional
- data structure
- subgraph mining
- dense stereo
- graph theoretic
- maximum clique
- frequent subgraph mining
- graph theory
- sparse data
- labeled graphs
- connected subgraphs
- graph patterns
- graph search
- graph structures
- frequently occurring
- maximal cliques
- pattern mining
- dense optical flow
- dense motion estimation
- motion field estimation
- gaussian graphical models
- dense sampling
- dense subgraphs
- helmholtz principle
- query graph
- topological information
- queueing networks
- graph representation
- graph structure
- graph matching
- sparse representation