Search Constraints

Filtering by: Campus Northridge Remove constraint Campus: Northridge Creator Flores-Penaloza, David Remove constraint Creator: Flores-Penaloza, David

Search Results

  • 7h149s73r?file=thumbnail
    Article
    Meijer, Henk
    Given 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 . . .