Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture.
Julien BensmailJakub PrzybyloPublished in: Discret. Appl. Math. (2019)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- graph properties
- graph structures
- subgraph matching
- labeled graphs
- subgraph mining
- reachability queries
- graph data
- connected subgraphs
- maximum common subgraph
- maximum clique
- dense subgraphs
- graph matching
- topological information
- query graph
- frequent subgraph mining
- graph patterns
- directed graph
- data structure
- frequent subgraphs
- graph theory
- maximal cliques
- association graph
- weighted graph
- graph theoretic
- connected components
- community discovery
- spatial information
- structured data
- random walk
- spanning tree
- query language
- graph model
- quasi cliques
- clustering algorithm