On the Complexity of Shortest Path Problems on Discounted Cost Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-37064-9_6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Optimization of Shortest-Path Search on RDBMS-Based Graphs

ISPRS International Journal of Geo-Information
DevelopmentPlanetary SciencesComputers in Earth SciencesPlanningEarthGeography
2019English

An Analysis of Stochastic Shortest Path Problems

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
1991English

The Quadratic Shortest Path Problem: Complexity, Approximability, and Solution Methods

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2018English

Competition for Shortest Paths on Sparse Graphs

Physical Review Letters
AstronomyPhysics
2012English

The Complexity of Dissociation Set Problems in Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2011English

On the Complexity of Reinforcement in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2016English

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1998English

Shortest Path Set Induced Vertex Ordering and Its Application to Distributed Distance Optimal Formation Path Planning and Control on Graphs

2013English

On the Path-Width of Planar Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy