Pages that link to "Item:Q4429688"

The following pages link to Reachability and Distance Queries via 2-Hop Labels (Q4429688):

Displaying 21 items.

• The hierarchical hub labeling is non-efficient (Q255772) (← links)
• Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs (Q891679) (← links)
• Approximate shortest paths guided by a small index (Q973004) (← links)
• Randomized proof-labeling schemes (Q2002054) (← links)
• Efficient single-pair all-shortest-path query processing for massive dynamic networks (Q2055599) (← links)
• Eccentricity queries and beyond using hub labels (Q2166770) (← links)
• Reachability oracles for directed transmission graphs (Q2309470) (← links)
• On the Complexity of Hub Labeling (Extended Abstract) (Q2946377) (← links)
• VC-Dimension and Shortest Path Algorithms (Q3012843) (← links)
• Utilizing multilevel community center labels for distance querying in large graphs (Q3195750) (← links)
• On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140) (← links)
• Access, Rank, and Select in Grammar-compressed Strings (Q3452777) (← links)
• Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms (Q3452861) (← links)
• Fully Dynamic 2-Hop Cover Labeling (Q4629540) (← links)
• Computing Constrained Shortest-Paths at Scale (Q5031006) (← links)
• (Q5092347) (← links)
• Shortest-path queries in static networks (Q5176178) (← links)
• (Q5874487) (← links)
• Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended (Q5881345) (← links)
• Reachability in big graphs: a distributed indexing and querying approach (Q6065881) (← links)
• Exact and approximate hierarchical hub labeling (Q6575394) (← links)