Average distances in undirected graphs and the removal of vertices.

Published in: J. Comb. Theory, Ser. B (1990)

Keyphrases

undirected graph
approximation algorithms
directed graph
directed acyclic graph
vertex set
connected components
spanning tree
minimum cost
complex networks
graph structure
random graphs
disjoint paths
multicommodity flow
distance function
reinforcement learning
adjacency matrix
average degree