The Complexity of Some Classes of Pyramid Graphs Created from a Gear Graph.
Jia-Bao LiuSalama Nagy DaoudPublished in: Symmetry (2018)
Keyphrases
- graph representation
- graph theory
- weighted graph
- directed graph
- graph structure
- polynomial time complexity
- graph theoretic
- graph construction
- graph mining
- labeled graphs
- graph databases
- graph classification
- graph isomorphism
- graph model
- graph matching
- adjacency matrix
- graph structures
- graph search
- bounded degree
- tractable cases
- graph partitioning
- bounded treewidth
- graph properties
- graph clustering
- graph data
- random graphs
- minimum spanning tree
- multiresolution
- bipartite graph
- spanning tree
- directed acyclic
- undirected graph
- graph representations
- subgraph isomorphism
- graph theoretical
- series parallel
- web graph
- structural pattern recognition
- disk resident
- graph transformation
- proximity graph
- connected dominating set
- complexity measures
- pattern mining
- small world
- graph kernels
- multiscale
- maximum common subgraph
- np complete
- random walk
- reachability queries
- dynamic graph
- graph patterns
- maximal cliques
- graph embedding
- adjacency graph
- computational complexity
- inexact graph matching
- planar graphs
- vertex set