On some covering graphs of a graph.
Shariefuddin PirzadaHilal A. GanieMerajuddin SiddiquePublished in: Electron. J. Graph Theory Appl. (2016)
Keyphrases
- graph representation
- graph structure
- weighted graph
- directed graph
- graph theory
- graph construction
- graph matching
- graph databases
- labeled graphs
- adjacency matrix
- graph theoretic
- graph classification
- graph properties
- graph clustering
- random graphs
- graph theoretical
- graph model
- graph partitioning
- graph structures
- graph mining
- bipartite graph
- graph search
- structural pattern recognition
- subgraph isomorphism
- series parallel
- undirected graph
- disk resident
- graph isomorphism
- graph data
- graph representations
- reachability queries
- dynamic graph
- evolving graphs
- graph transformation
- independent set
- maximum cardinality
- graph edit distance
- directed acyclic
- graph kernels
- graph patterns
- minimum spanning tree
- connected graphs
- maximum common subgraph
- maximum independent set
- random walk
- graph embedding
- dense subgraphs
- planar graphs
- structured data
- bounded treewidth
- real world graphs
- inexact graph matching
- graph layout
- web graph
- edge weights
- association graph
- community discovery
- maximum clique
- connected components
- spanning tree
- quasi cliques
- neighborhood graph
- relational structures
- social networks
- spectral decomposition
- average degree
- social graphs
- adjacency graph
- maximal cliques
- strongly connected
- graph drawing
- relational graph
- small world
- finding the shortest path
- vertex set
- query graph
- shortest path
- np complete