Subdivision of the Hierarchy of H-colorable Graph Classes by Circulant Graphs.
Akihiro UejimaHiro ItoPublished in: CTW (2004)
Keyphrases
- graph theory
- graph representation
- graph construction
- weighted graph
- graph databases
- graph structure
- graph model
- directed graph
- graph structures
- graph matching
- adjacency matrix
- labeled graphs
- graph mining
- class hierarchy
- graph properties
- graph theoretic
- graph clustering
- graph classification
- undirected graph
- series parallel
- directed acyclic
- graph theoretical
- graph data
- bipartite graph
- dynamic graph
- bounded degree
- graph isomorphism
- graph search
- random graphs
- subgraph isomorphism
- graph transformation
- graph partitioning
- structural pattern recognition
- disk resident
- spanning tree
- maximum cardinality
- reachability queries
- graph patterns
- minimum spanning tree
- topological information
- graph representations
- connected dominating set
- inexact graph matching
- connected graphs
- dense subgraphs
- planar graphs
- maximum clique
- maximum common subgraph
- structured data
- real world graphs
- graph layout
- graph kernels
- edge weights
- least squares
- attributed graphs
- hierarchical structure
- directed acyclic graph
- neighborhood graph
- adjacency graph
- maximal cliques
- web graph
- discrete fourier transform
- frequent subgraphs
- quasi cliques
- evolving graphs
- subdivision scheme
- finding the shortest path
- random walk
- attack graph
- bounded treewidth