Graphs Whose Indecomposability Graph is 2-Covered.
Rim Ben HamadouImed BoudabbousPublished in: J. Multiple Valued Log. Soft Comput. (2015)
Keyphrases
- graph representation
- graph theory
- directed graph
- labeled graphs
- adjacency matrix
- graph model
- graph theoretic
- graph structure
- graph matching
- graph construction
- graph databases
- graph theoretical
- graph structures
- graph mining
- weighted graph
- graph classification
- graph properties
- graph clustering
- graph data
- random graphs
- graph isomorphism
- dynamic graph
- subgraph isomorphism
- structural pattern recognition
- bipartite graph
- series parallel
- graph partitioning
- undirected graph
- graph edit distance
- graph transformation
- maximum common subgraph
- graph layout
- graph search
- attributed graphs
- graph representations
- dense subgraphs
- spanning tree
- graph kernels
- maximum cardinality
- evolving graphs
- minimum spanning tree
- maximum independent set
- adjacency graph
- maximum clique
- reachability queries
- neighborhood graph
- graph embedding
- directed acyclic
- graph drawing
- disk resident
- connected dominating set
- real world graphs
- association graph
- frequent subgraphs
- average degree
- inexact graph matching
- connected graphs
- graph patterns
- web graph
- small world
- social graphs
- query graph
- pattern mining
- proximity graph
- np complete
- random walk
- edge weights
- massive graphs
- relational structures
- maximal cliques
- spectral decomposition
- independent set
- polynomial time complexity