On Distance-Based Topological Descriptors of Subdivision Vertex-Edge Join of Three Graphs.
Hong YangMuhammad ImranShehnaz AkhterZahid IqbalMuhammad Kamran SiddiquiPublished in: IEEE Access (2019)
Keyphrases
- undirected graph
- edge weights
- vertex set
- weighted graph
- directed graph
- connected components
- minimum weight
- spanning tree
- directed acyclic graph
- labeled graphs
- bipartite graph
- graph structure
- attributed graphs
- complex networks
- approximation algorithms
- strongly connected
- minimum cost
- random graphs
- minimum spanning trees
- reeb graph
- maximum cardinality
- graph matching
- topological information
- join algorithms
- control points
- graph theory
- connected subgraphs
- image retrieval
- multiresolution
- distance measure
- topological features
- graph kernels
- topological properties
- shape descriptors
- binary images
- database systems
- graph theoretic
- outlier detection
- query optimization
- orientation histogram
- shortest path
- keypoints
- image segmentation
- average degree
- hamiltonian cycle
- feature vectors
- euclidean distance
- query processing
- level set
- image descriptors
- random walk
- small world