On the distance connectivity of graphs and digraphs.
Miguel Angel FiolJosep FàbregaPublished in: Discret. Math. (1994)
Keyphrases
- directed graph
- strongly connected
- distance measure
- graph matching
- undirected graph
- distance function
- euclidean distance
- graph theory
- nearest neighbor
- equivalence classes
- graph partitioning
- graph model
- graph structure
- graph representation
- markov models
- connected components
- neighborhood graph
- series parallel
- neural network