Shortest-Path and Minimum-Delay Algorithms in Networks With Time-Dependent Edge-Length

Journal of the ACM - United States
doi 10.1145/79147.214078
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computing Machinery (ACM)

Related search

CASPaR: Congestion Avoidance Shortest Path Routing for Delay Tolerant Networks

International Journal of Distributed Sensor Networks
Computer NetworksEngineeringCommunications
2017English

Bicriterion Shortest Paths in Stochastic Time-Dependent Networks

Lecture Notes in Economics and Mathematical Systems
MathematicsEconomicsEconometricsFinance
English

Efficient Algorithms for the Minimum Shortest Path Steiner Arborescence Problem With Applications to VLSI Physical Design

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ElectricalSoftwareComputer GraphicsComputer-Aided DesignElectronic Engineering
1998English

Calculating Graph Algorithms for Dominance and Shortest Path

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Performance Routing With Shortest Path Exploration in Wireless Mesh Networks

Kongunadu Research Journal
2020English

I/O-Efficient Algorithms for Shortest Path Related Problems

English

Efficient Processing of Which-Edge Questions on Shortest Path Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Path Selection Algorithm With Minimal Delay in Wireless Sensor Networks

International Journal of Distributed Sensor Networks
Computer NetworksEngineeringCommunications
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy