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 4 of 4 for “"experimental algorithmics"”.
-
Path Centrality: A New Centrality Measure in Networks
… centrality measure called k-path centrality and experimentally compare this measure with betweenness centrality. We present a polynomial-time randomized algorithm for distinguishing high k-path centrality vertices from low k-path centrality vertices in any given (unweighted or weighted) graph. …
-
An Experimental Study of Distance Sensitivity Oracles
… increasing number of vertices and edges, we have experimentally validated that their algorithm holds true to their statements of space, running time, and query time.
-
Fast-sparse-spanner: A practical algorithm for constructing low-stretch sparse geometric graphs
When constructing geometric graphs (vertices are points and edges are line segments connecting point pairs) on pointsets, stretch-factor (worst-case detour between any point pair) is often considered a quality metric. A low stretch-factor (a quantity that is usually > 1) guarantees short paths …
-
Bounded-degree Plane Geometric Spanners: Connecting the Dots Between Theory and Practice
The construction of bounded-degree plane geometric spanners has been a focus of interest since 2002 when Bose, Gudmundsson, and Smid proposed the first algorithm to construct such spanners. To date, eleven algorithms have been designed with various trade-offs in degree and stretch factor. We have …