|
Organizers |
Computing Distances in Graphs
by
Wesley Calvert
Southern Illinois University
Coauthors: Russell Miller and Jennifer Chubb Reimann
How can we compute the distance between vertices in a graph, given only data on adjacency? If there are infinitely many vertices, this problem may be unsolvable, but it can still be approximated in an interesting way.
It turns out that distances in graphs capture this sort of approximation exactly, in that any function that can be approximated can be approximated by a graph. I'll give examples that aren't obviously graph-like.
Date received: March 8, 2012
Copyright © 2012 by the author(s). The author(s) of this work and the organizers of the conference have granted their consent to include this abstract in Topology Atlas. Document # cbek-10.