Graph structural properties of non-Yutsis graphs allowing fast recognition.
Robert E. L. AldredDries Van DyckGunnar BrinkmannVeerle FackBrendan D. McKayPublished in: Discret. Appl. Math. (2009)
Keyphrases
- structural properties
- tree width
- graph representation
- graph theory
- graph matching
- graph properties
- weighted graph
- clustering coefficient
- graph clustering
- graph structure
- directed graph
- graph structures
- graph construction
- graph model
- graph databases
- graph theoretic
- labeled graphs
- object recognition
- graph mining
- adjacency matrix
- series parallel
- network properties
- graph theoretical
- rewriting rules
- undirected graph
- graph search
- graph data
- graph kernels
- spanning tree
- subgraph isomorphism
- structural pattern recognition
- bipartite graph
- graph partitioning
- graph isomorphism
- random graphs
- graph classification
- real world graphs
- reachability queries
- topological properties
- connected components
- degree distribution
- graph representations
- graph layout
- finding the shortest path
- maximal cliques
- dense subgraphs
- edge weights
- maximum common subgraph
- planar graphs
- tree decomposition
- small world
- web graph
- network evolution
- polynomial time complexity
- graph patterns
- structured data
- maximum clique
- neighborhood graph
- densely connected
- dynamic graph
- directed acyclic graph
- massive graphs
- random walk