Iterative procedure for the generalized graph center in polycyclic graphs.
Danail BonchevOvanes G. MekenyanAlexandru T. BalabanPublished in: J. Chem. Inf. Comput. Sci. (1989)
Keyphrases
- iterative procedure
- graph theory
- graph representation
- graph structure
- graph theoretic
- labeled graphs
- graph construction
- graph databases
- directed graph
- graph matching
- graph mining
- weighted graph
- closed form
- graph structures
- random graphs
- graph theoretical
- graph model
- graph partitioning
- graph clustering
- adjacency matrix
- bipartite graph
- graph data
- series parallel
- graph classification
- directed acyclic
- graph properties
- graph representations
- subgraph isomorphism
- graph search
- structural pattern recognition
- undirected graph
- adjacency graph
- spanning tree
- maximum independent set
- maximum clique
- graph kernels
- inexact graph matching
- graph transformation
- maximum common subgraph
- social graphs
- minimum spanning tree
- web graph
- graph isomorphism
- average degree
- strongly connected
- dynamic graph
- reachability queries
- dense subgraphs
- connected graphs
- edge weights
- structured data
- graph drawing
- polynomial time complexity
- connected dominating set
- graph embedding
- query graph
- planar graphs
- bounded treewidth
- optimal solution
- neighborhood graph
- disk resident
- maximal cliques
- evolving graphs
- finding the shortest path
- random walk
- hyper graph
- graph patterns
- directed acyclic graph
- link prediction
- attributed relational graph
- pattern mining