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 6 of 6 for “"Path Counting"”.

  1. Accelerating Shortest Path Counting on Road Networks

    Counting the number of shortest paths between two query vertices on road networks has a wide range of applications and has recently drawn significant research attention. The state-of-the-art solution builds a tree-based index using the concept of tree decomposition. However, its performance …

    unsw Repository record for Accelerating Shortest Path Counting on Road Networks (opens in a new tab)

  2. Path Queries in Weighted Trees

    … assigned a weight, in order to support various path queries, for which a certain function over the weights of the nodes along a given query path in the tree is computed [3, 14, 22, 26]. In this thesis, we consider the problem of supporting several various path queries over a tree on n weighted …

    waterloo Repository record for Path Queries in Weighted Trees (opens in a new tab)

  3. In-Memory Storage for Labeled Tree-Structured Data

    … and weights trees, so that various types of path queries or operations can be supported with efficient query time. We assume the word RAM model with word size w, which permits random accesses to w-bit memory cells. Our data structures are space-efficient and many of them are even succinct. …

    waterloo Repository record for In-Memory Storage for Labeled Tree-Structured Data (opens in a new tab)

  4. Exploring Shortest Path-Based Queries on Massive Graphs

    … with graph analysis, the study of shortest paths is crucial due to its wide-ranging applications. This thesis delves into several shortest path-based problems in graph analysis, focusing on the shortest path counting and shortest cycle counting queries on dynamic graphs, as well as top-k …

    unsw Repository record for Exploring Shortest Path-Based Queries on Massive Graphs (opens in a new tab)

  5. Unambiguous Functions in Logarithmic Space

    … some reductions between different variants of path counting problems. We also investigate more carefully the technique of inductive counting, and obtain improvement of some existing results.</p>

    mcmaster Repository record for Unambiguous Functions in Logarithmic Space (opens in a new tab)

  6. Towards Efficient Shortest Path Related-Queries on Large-Scale Graphs

    … challenges in graph analysis, shortest-path computation plays a critical role due to its ubiquitous applications in routing, optimization, and data mining. This thesis addresses advanced shortest-path query problems within graph databases, with particular emphasis on scalability and …

    unsw Repository record for Towards Efficient Shortest Path Related-Queries on Large-Scale Graphs (opens in a new tab)