I had trouble naming the following scenario: turn a graph G into a complete graph with weighted edges such that each edge's weight represents the distance between the two vertices (ie, a distance matrix except for on a complete graph).
Turns out, this is called metric completion of a graph. Now we can google away!
No comments:
Post a Comment