Filtering by: Campus Northridge Remove constraint Campus: Northridge Creator Sacristan, Vera Remove constraint Creator: Sacristan, Vera
ArticleMeijer, HenkGiven a large weighted graph G = (V, E) and a subset U of V , we define several graphs with vertex set U in which two vertices are adjacent if they satisfy some prescribed proximity rule. These rules use the shortest path distance in G and generalize . . .