Processing of Hierarchically Defined Graphs and Graph Families.
Franz HöftingThomas LengauerEgon WankePublished in: Data Structures and Efficient Algorithms (1992)
Keyphrases
- graph representation
- graph theoretic
- graph theory
- graph matching
- graph mining
- weighted graph
- graph structure
- graph databases
- graph partitioning
- directed graph
- adjacency matrix
- graph model
- bipartite graph
- series parallel
- graph search
- graph properties
- graph clustering
- undirected graph
- graph construction
- graph theoretical
- graph structures
- graph classification
- random graphs
- graph kernels
- graph isomorphism
- graph data
- spanning tree
- labeled graphs
- adjacency graph
- planar graphs
- attributed graphs
- connected dominating set
- subgraph isomorphism
- minimum spanning tree
- finding the shortest path
- dense subgraphs
- reachability queries
- random walk
- structured data
- strongly connected
- directed acyclic graph
- graph representations
- connected components
- evolving graphs
- graph transformation
- directed acyclic
- graph drawing
- dynamic graph
- maximum common subgraph
- inexact graph matching
- social networks
- maximum independent set
- maximal cliques
- proximity graph
- average degree
- real world graphs
- hierarchical structure
- pattern mining
- small world
- relational structures
- community discovery