Filters








992 Hits in 9.5 sec

Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks [article]

Minhao Jiang, Ada Wai-Chee Fu, Raymond Chi-Wing Wong, Yanyan Xu
2014 arXiv   pre-print
Given a directed or undirected graph, we propose to build an index for answering such queries based on a hop-doubling labeling technique.  ...  We show that our method is much more efficient compared to the state-of-the-art technique, in terms of both querying time and indexing time.  ...  The more recent works of IS-Label in [18] and the pruned landmark labeling (PLL) scheme in [7] can handle bigger graphs. Both are 2-hop labeling methods [15] . Challenges.  ... 
arXiv:1403.0779v2 fatcat:4wtpx2b26bem7h2faps4ygiwua

Hop doubling label indexing for point-to-point distance querying on scale-free networks

Minhao Jiang, Ada Wai-Chee Fu, Raymond Chi-Wing Wong, Yanyan Xu
2014 Proceedings of the VLDB Endowment  
Given a directed or undirected graph, we propose to build an index for answering such queries based on a novel hop-doubling labeling technique.  ...  We show that our method is much more efficient and effective compared to the state-of-the-art techniques, in terms of both querying time and indexing costs.  ...  The more recent works of IS-Label in [18] and the pruned landmark labeling (PLL) scheme in [7] can handle bigger graphs. Both are 2-hop labeling methods [15] . Challenges.  ... 
doi:10.14778/2732977.2732993 fatcat:djklqrlelzhcllv7mvid7k3k5q

Multi-Constraint Shortest Path using Forest Hop Labeling [article]

Ziyi Liu, Lei Li, Mengxuan Zhang, Wen Hua, Xiaofang Zhou
2021 arXiv   pre-print
Furthermore, to scale up to larger networks, we propose a novel forest hop labeling which enables the parallel label construction from different network partitions.  ...  In this paper, we propose a novel high-dimensional skyline path concatenation method to avoid the expensive skyline path search, which then supports the efficient construction of hop labeling index for  ...  CT-Index [30] combines H2H and PLL to deal with the periphery and core of a graph separately.  ... 
arXiv:2109.04221v1 fatcat:j5rrsy5rvvchvezmo67qzqeeoq

Graph indexing of road networks for shortest path queries with label restrictions

Michael Rice, Vassilis J. Tsotras
2010 Proceedings of the VLDB Endowment  
the naïve adaptation of the standard Dijkstra's algorithm to support this query type.  ...  roads or modes of travel which may be considered in a multimodal transportation network).  ...  In later sections dealing with the graph index construction, we must extend the notion of edge labels to include support for multiple labels per edge.  ... 
doi:10.14778/1921071.1921074 fatcat:moyr6hpagfa3jezfojzlzo5hna

Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons [article]

Adrian Kosowski
2016 arXiv   pre-print
We show that skeleton dimension admits an intuitive definition for both directed and undirected graphs, provides a way of computing labels more efficiently than by using highway dimension, and leads to  ...  The goal of a hub-based distance labeling scheme for a network G = (V, E) is to assign a small subset S(u) ⊆ V to each node u ∈ V, in such a way that for any pair of nodes u, v, the intersection of hub  ...  We also thank PU and Zuzanna Kosowska-Stamirowska for their help with the figures.  ... 
arXiv:1609.00512v2 fatcat:qj7uqtt7rneyrgq4nopoyfqwdi

BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale [article]

Muhammad Farhan and Qing Wang and Henning Koehler
2022 arXiv   pre-print
We devise batch-dynamic algorithms to dynamize a distance labelling efficiently in order to reflect batch updates on the underlying graph.  ...  Many real-world applications operate on dynamic graphs that undergo rapid changes in their topological structure over time.  ...  This method is based on the pruned landmark labelling (PLL) [4] . -PSL* [25] : A parallel algorithm which constructs pruned landmark labelling for static graphs to answer distance queries.  ... 
arXiv:2204.11012v1 fatcat:gz2dtdzqrnbtbk7u3cn7yxyo64

Hub Labels on the database for large-scale graphs with the COLD framework

Alexandros Efentakis, Christodoulos Efstathiades, Dieter Pfoser
2017 Geoinformatica  
An aspect that has only recently attracted attention is the use of databases in combination with graph algorithms, socalled distance oracles, to compute shortest-path queries on large graphs.  ...  Shortest-path computation on graphs is one of the most well-studied problems in algorithmic theory.  ...  In the case of largescale graphs, the Pruned Landmark Labeling (PLL) algorithm of [6] produces a minimal labeling for a specified vertex ordering.  ... 
doi:10.1007/s10707-016-0287-5 fatcat:sqz7o5bogbgevaq6iafh3ifa4e

Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons

Adrian Kosowski, Laurent Viennot
2017 Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms  
We show that skeleton dimension admits an intuitive definition for both directed and undirected graphs, provides a way of computing labels more efficiently than by using highway dimension, and leads to  ...  The goal of a hub-based distance labeling scheme for a network G = (V, E) is to assign a small subset S(u) ⊆ V to each node u ∈ V , in such a way that for any pair of nodes u, v, the intersection of hub  ...  We also thank PU and Zuzanna Kosowska-Stamirowska for their help with the figures.  ... 
doi:10.1137/1.9781611974782.95 dblp:conf/soda/KosowskiV17 fatcat:dig2lsbik5bubhi3uhdkm6vulm

Pruning based Distance Sketches with Provable Guarantees on Random Graphs [article]

Hongyang Zhang, Huacheng Yu, Ashish Goel
2019 arXiv   pre-print
In this work, we present a preprocessing algorithm that is able to create landmark based distance sketches efficiently, with strong theoretical guarantees.  ...  On Erdös-Rényi graphs and random power law graphs with degree distribution exponent 2 < β < 3, our algorithm outputs an exact distance data structure with space between Θ(n^5/4) and Θ(n^3/2) depending  ...  We first compare Algorithm 2 with the pruned labeling algorithm [3] .  ... 
arXiv:1712.08709v3 fatcat:tgcg5i3qzjaxhna2m2onh4uyki

Performance Analysis of Parallel Speedup Techniques for Shortest Path Queries in Networks of Random and Planar Types

R. Kalpana, P.Thambidurai P.Thambidurai
2012 International Journal of Computer Applications  
This paper deals with comparison of parallelized speedup techniques with sequential version of the same and finding performance improvement achieved in parallelized speedup techniques with respect to runtime  ...  Performance of parallelization has good impact of speedup in random graph type of networks(45% to 90% with respect to runtime and 25% to 830% with respect to vertices visited) than planar graph type of  ...  Running times are dependent on machine in which the algorithm is implemented and implementation strategy adapted.  ... 
doi:10.5120/7506-0618 fatcat:espn7fpelndmfndohdc7fckm5e

Route Planning in Transportation Networks [chapter]

Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2016 Lecture Notes in Computer Science  
Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic.  ...  We survey recent advances in algorithms for route planning in transportation networks.  ...  Pruned Highway Labeling. The Pruned Highway Labeling (PHL) [11] algorithm can be seen as a hybrid between pure labeling and transit nodes.  ... 
doi:10.1007/978-3-319-49487-6_2 fatcat:zbg272ftdfempady3cjynh6q4e

Route Planning in Transportation Networks [article]

Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck
2015 arXiv   pre-print
Some algorithms can answer queries in a fraction of a microsecond, while others can deal efficiently with real-time traffic.  ...  We survey recent advances in algorithms for route planning in transportation networks.  ...  Pruned Highway Labeling. The Pruned Highway Labeling (PHL) [11] algorithm can be seen as a hybrid between pure labeling and transit nodes.  ... 
arXiv:1504.05140v1 fatcat:ox42rhvuynd5loq6dljhnfecvu

A Survey of Shortest-Path Algorithms [article]

Amgad Madkour, Walid G. Aref, Faizan Ur Rehman, Mohamed Abdur Rahman, Saleh Basalamah
2017 arXiv   pre-print
A shortest-path algorithm finds a path containing the minimal cost between two vertices in a graph.  ...  The survey also presents the challenges and proposed solutions associated with each category in the taxonomy.  ...  Aref's research has been supported in part by the National Science Foundation under Grant IIS 1117766.  ... 
arXiv:1705.02044v1 fatcat:fkh55mi34vezhbvjbzu7ekmdai

MUSE: Multimodal Separators for Efficient Route Planning in Transportation Networks

Amine Mohamed Falek, Cristel Pelsser, Sebastien Julien, Fabrice Theoleyre
2022 Transportation Science  
We also augment our algorithm with heuristics during the query phase to achieve further speedups with minimal effect on correctness.  ...  We present a multimodal separators–based algorithm (MUSE), a new multimodal algorithm based on graph separators to compute shortest travel time paths.  ...  By combining label constraints with a profile label correcting algorithm during preprocessing, we can efficiently handle modal constraints and time-dependency.  ... 
doi:10.1287/trsc.2021.1104 fatcat:rp2jck4pifdmpb5vwd327sx4ei

Temporal landmark graphs for solving overconstrained planning problems

Eliseo Marzal, Laura Sebastia, Eva Onaindia
2016 Knowledge-Based Systems  
Thus, the partial plans of the search tree that are not compliant with the information comprised in this graph are pruned.  ...  The temporal landmarks extracted from the problem form a landmarks graph where nodes are landmarks and edges represent temporal as well as causal relationships between landmarks.  ...  Acknowledgements We thank Derek Long for solving our doubts about the modal operators in PDDL3 and Erez Karpas for supplying the compiled domain and problem files with their temporal landmarks.  ... 
doi:10.1016/j.knosys.2016.05.029 fatcat:qu524osna5h73hdu2we4bsaxnm
« Previous Showing results 1 — 15 out of 992 results