Graph parameters measuring neighbourhoods in graphs - Bounds and applications.
Frank GurskiPublished in: Discret. Appl. Math. (2008)
Keyphrases
- graph structure
- graph representation
- graph theory
- graph theoretic
- graph matching
- weighted graph
- labeled graphs
- graph clustering
- graph construction
- graph structures
- graph model
- directed graph
- adjacency matrix
- graph theoretical
- graph classification
- graph mining
- series parallel
- graph properties
- random graphs
- graph databases
- spanning tree
- bipartite graph
- graph partitioning
- graph data
- maximum likelihood
- structural pattern recognition
- upper bound
- graph transformation
- subgraph isomorphism
- disk resident
- graph kernels
- structured data
- connected dominating set
- maximal cliques
- reachability queries
- directed acyclic
- graph patterns
- strongly connected
- undirected graph
- worst case
- massive graphs
- graph search
- lower bound
- graph drawing
- maximum cardinality
- inexact graph matching
- attributed graphs
- bounded treewidth
- finding the shortest path
- connected graphs
- maximum common subgraph
- random walk
- graph connectivity
- dynamic graph
- polynomial time complexity
- graph isomorphism
- adjacency graph
- maximum clique
- directed acyclic graph
- neighborhood graph
- community discovery