Amanote Research

Amanote Research

    RegisterSign In

Shortest-Paths Preserving Metro Maps

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-25878-7_45
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2012

Authors
Tal MileaOkke SchrijversKevin BuchinHerman Haverkort
Publisher

Springer Berlin Heidelberg


Related search

All Pairs Shortest Paths

An Elementary Approach to Design and Analysis of Algorithms
2019English

Shortest Gently Descending Paths

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Physarum Can Compute Shortest Paths

2012English

Implementing Parallel Shortest-Paths Algorithms

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1997English

Connectivity-Optimal Shortest Paths Using Crowdsourced Data

2016English

Competition for Shortest Paths on Sparse Graphs

Physical Review Letters
AstronomyPhysics
2012English

Finding K-Shortest Paths With Limited Overlap

VLDB Journal
HardwareInformation SystemsArchitecture
2020English

SPTH3: Subroutine for Finding Shortest Sabotage Paths

1977English

Approximating Shortest Paths in Spatial Social Networks

2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy