On decomposing regular graphs into locally irregular subgraphs.
Olivier BaudonJulien BensmailJakub PrzybyloMariusz WozniakPublished in: Eur. J. Comb. (2015)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- graph properties
- subgraph matching
- connected subgraphs
- graph data
- graph structures
- frequent subgraph mining
- labeled graphs
- maximum common subgraph
- subgraph mining
- reachability queries
- dense subgraphs
- graph patterns
- topological information
- graph matching
- maximum clique
- data structure
- pattern mining
- directed graph
- graph structure
- query graph
- data mining
- arbitrarily shaped
- irregularly shaped
- graph theory
- frequent subgraphs
- maximal cliques
- community discovery
- globally consistent
- directed acyclic graph
- graph clustering
- graph construction
- pattern discovery
- complex networks
- semi supervised