Fast Landmark Reconfiguration for Highway Cover Indexes

No abstract is available for this paper.

• Publication year

  2026

• Venue

  International Conference on Extending Database Technology

• Publication date

  Unknown publication date

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.48786/edbt.2026.18
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Indexing Graphs for Shortest Beer Path Queries

  2024influential reference
• Graph Spanners for Group Steiner Distances

  2024cited by this paper
• Shortest Beer Path Queries based on Graph Decomposition

  2023cited by this paper
• Top-k Distance Queries on Large Time-Evolving Graphs

  2023cited by this paper
• Efficient maintenance of highway cover labelling for distance queries on large dynamic graphs

  2023influential reference
• Fast Computation of Shortest Smooth Paths and Uniformly Bounded Stretch with Lazy RPHAST

  2022cited by this paper
• Towards Real-Time Counting Shortest Cycles on Dynamic Graphs: A Hub Labeling Approach

  2022cited by this paper
• Shortest Beer Path Queries in Outerplanar Graphs

  2021cited by this paper
• Fast fully dynamic labelling for distance queries

  2021influential reference
• Answering reachability and K-reach queries on large graphs with label constraints

  2021cited by this paper
• Dynamic Public Transit Labeling

  2019cited by this paper
• Fully Dynamic 2-Hop Cover Labeling

  2019cited by this paper
• A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks

  2018influential reference
• Finding shortest keyword covering routes in road networks

  2018cited by this paper
• Fully Dynamic Betweenness Centrality Maintenance on Massive Networks

  2015cited by this paper
• Route Planning in Transportation Networks

  2015cited by this paper
• Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling

  2015cited by this paper
• Hub Labels: Theory and Practice

  2014influential reference
• Robust Distance Queries on Massive Networks

  2014influential reference
• Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching

  2014cited by this paper
• Customizable Contraction Hierarchies

  2014cited by this paper
• Fast exact shortest-path distance queries on large networks by pruned landmark labeling

  2013cited by this paper
• Customizable Point-of-Interest Queries in Road Networks

  2013cited by this paper
• Transit Node Routing Reconsidered

  2013cited by this paper
• KONECT: the Koblenz network collection

  2013cited by this paper
• Exact Routing in Large Road Networks Using Contraction Hierarchies

  2012cited by this paper
• The Yahoo! Music Dataset and KDD-Cup '11

  2012cited by this paper
• Customizable Route Planning

  2011cited by this paper
• Measuring User Influence in Twitter: The Million Follower Fallacy

  2010cited by this paper
• Routing in Road Networks with Transit Nodes

  2008cited by this paper
• Fast Point-to-Point Shortest Path Computations with Arc-Flags

  2006cited by this paper
• Reachability and distance queries via 2-hop labels

  2002cited by this paper
• Random Graphs

  1985cited by this paper

• No citing papers are available for this paper.