Amanote Research

Amanote Research

    RegisterSign In

Computing Many-To-Many Shortest Paths Using Highway Hierarchies

doi 10.1137/1.9781611972870.4
Full Text
Open PDF
Abstract

Available in full text

Date

January 6, 2007

Authors
Sebastian KnoppPeter SandersDominik SchultesFrank SchulzDorothea Wagner
Publisher

Society for Industrial and Applied Mathematics


Related search

Highway Dimension, Shortest Paths, and Provably Efficient Algorithms

2010English

Computing on Many Cores

Concurrency Computation Practice and Experience
Computer NetworksCommunicationsComputer Science ApplicationsComputational TheoryMathematicsTheoretical Computer ScienceSoftware
2017English

Quantum Materials: Where Many Paths Meet

MRS Bulletin
Materials ScienceTheoretical ChemistryCondensed Matter PhysicsPhysical
2017English

One Subject, Many Paths. Transmedia Communication in Journalism

Brazilian Journalism Research
Communication
2012English

Dopamine Supersensitivity Correlates With D2High States, Implying Many Paths to Psychosis

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
2005English

Highway Hierarchies Star

The Shortest Path Problem
2009English

Connectivity-Optimal Shortest Paths Using Crowdsourced Data

2016English

The Many Paths to Asthma: Phenotype Shaped by Innate and Adaptive Immunity

Nature Immunology
AllergyImmunology
2010English

Finding Paths in Sparse Random Graphs Requires Many Queries

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy