Graph Classes between Parity and Distance-Hereditary Graphs.
Serafino CiceroneGabriele Di StefanoPublished in: DMTCS (1996)
Keyphrases
- graph theory
- graph structure
- graph representation
- directed graph
- graph construction
- graph mining
- weighted graph
- graph matching
- graph theoretic
- graph classification
- graph databases
- adjacency matrix
- neighborhood graph
- edge weights
- graph structures
- labeled graphs
- graph model
- graph theoretical
- random graphs
- graph partitioning
- bounded degree
- graph properties
- undirected graph
- graph clustering
- minimum spanning tree
- graph isomorphism
- directed acyclic
- subgraph isomorphism
- structural pattern recognition
- graph search
- spanning tree
- graph transformation
- series parallel
- bipartite graph
- graph data
- graph kernels
- dynamic graph
- connected dominating set
- maximum common subgraph
- graph representations
- disk resident
- reachability queries
- graph drawing
- error correction
- connected graphs
- random walk
- dense subgraphs
- topological information
- planar graphs
- bounded treewidth
- maximum clique
- equivalence classes
- distance measure
- inexact graph matching
- structured data
- maximum cardinality
- graph embedding
- maximal cliques
- real world graphs
- proximity graph
- graph patterns
- massive graphs
- community discovery
- small world
- complex networks
- quasi cliques
- finding the shortest path
- attributed relational graph
- shortest path
- vertex set