Finite type graphs and some graph operations, II.
Miroslav PetrovicPublished in: Discret. Math. (1986)
Keyphrases
- graph representation
- graph matching
- graph structure
- graph theory
- labeled graphs
- graph model
- weighted graph
- directed graph
- graph databases
- graph theoretic
- graph mining
- graph classification
- graph theoretical
- graph data
- graph clustering
- graph structures
- graph properties
- adjacency matrix
- graph search
- graph construction
- reachability queries
- series parallel
- graph kernels
- massive graphs
- bipartite graph
- spanning tree
- dense subgraphs
- graph partitioning
- inexact graph matching
- graph representations
- graph transformation
- minimum spanning tree
- undirected graph
- structural pattern recognition
- planar graphs
- random graphs
- maximum clique
- graph patterns
- attributed graphs
- edge weights
- evolving graphs
- graph edit distance
- proximity graph
- dynamic graph
- average degree
- structured data
- social graphs
- real world graphs
- small world
- adjacency graph
- community discovery
- subgraph isomorphism
- graph isomorphism
- maximum common subgraph
- social networks
- maximum cardinality
- directed acyclic
- topological information
- bounded degree
- graph drawing
- frequent subgraphs
- finding the shortest path
- hyper graph
- connected graphs
- maximum independent set
- disk resident
- connected dominating set