Graph Classes Between Parity and Distance-hereditary Graphs.
Serafino CiceroneGabriele Di StefanoPublished in: Discret. Appl. Math. (1999)
Keyphrases
- graph representation
- directed graph
- bounded degree
- weighted graph
- graph matching
- graph databases
- labeled graphs
- graph structure
- graph construction
- graph theory
- edge weights
- graph mining
- graph model
- graph theoretic
- graph classification
- adjacency matrix
- graph clustering
- directed acyclic
- neighborhood graph
- graph structures
- subgraph isomorphism
- graph partitioning
- series parallel
- graph data
- spanning tree
- random graphs
- graph theoretical
- graph properties
- inexact graph matching
- graph isomorphism
- bipartite graph
- undirected graph
- graph transformation
- disk resident
- random walk
- structural pattern recognition
- connected graphs
- connected dominating set
- reachability queries
- planar graphs
- evolving graphs
- graph search
- structured data
- maximum common subgraph
- graph kernels
- graph representations
- distance function
- error correction
- finding the shortest path
- web graph
- maximum cardinality
- query graph
- connected components
- dynamic graph
- maximum clique
- minimum spanning tree
- distance measure
- graph patterns
- real world graphs
- equivalence classes
- community discovery
- graph layout
- knn
- shortest path
- dense subgraphs
- link analysis
- social graphs
- adjacency graph
- small world
- path length
- association graph
- topological information
- maximal cliques
- graph embedding