Bounding the distance among longest paths in a connected graph.
Jan EksteinShinya FujitaAdam KabelaJakub TeskaPublished in: Discret. Math. (2018)
Keyphrases
- neighborhood graph
- path length
- connected components
- upper bound
- shortest path
- distance measure
- structured data
- graph structure
- graph representation
- euclidean distance
- small world
- edge weights
- manifold learning
- data points
- graph construction
- directed acyclic graph
- connected graphs
- graph clustering
- graph model
- graph mining
- weighted graph
- graph theory
- directed graph
- distance function
- random walk
- bayesian networks
- undirected graph
- maximum number
- distance transform
- knn
- image segmentation
- distance matrix
- dependency graph
- disjoint paths
- neural network