Uniform generation of spanning regular subgraphs of a dense graph.
Pu GaoCatherine S. GreenhillPublished in: CoRR (2018)
Keyphrases
- quasi cliques
- graph mining
- graph databases
- graph properties
- subgraph mining
- frequently occurring
- graph structures
- graph data
- frequent subgraph mining
- maximum clique
- labeled graphs
- graph representation
- subgraph isomorphism
- random walk
- connected subgraphs
- biological networks
- graph theory
- directed graph
- directed acyclic graph
- subgraph matching
- structured data
- reachability queries
- query graph
- graph patterns
- pattern mining
- topological information
- generation process
- graph theoretic
- undirected graph
- graph model
- weighted graph
- maximum common subgraph
- graph based algorithm
- maximal cliques
- graph search
- spanning tree
- graph matching