Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"distance selection"”.

  1. Algorithms for Unit-Disk Graphs and Related Problems

    … such as shortest paths, clique, independent set, distance oracle, diameter, etc. Specifically, we study the following problems in this dissertation: L1 shortest paths in unit-disk graphs, reverse shortest paths in unit-disk graphs, minimum bottleneck moving spanning tree, unit-disk range …

    utahstate Repository record for Algorithms for Unit-Disk Graphs and Related Problems (opens in a new tab)