Calculating Graph Algorithms for Dominance and Shortest Path

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-642-31113-0_8

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Berlin Heidelberg

Related search

Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

The Shortest Path Problem for a Multiple Graph

Modeling and Analysis of Information Systems
2017English

Shortest Path Estimation for Graph Data Using a Relational Technique

International Journal of Database Management Systems
2015English

I/O-Efficient Algorithms for Shortest Path Related Problems

English

A Shortest-Path Graph Kernel for Estimating Gene Product Semantic Similarity

Journal of Biomedical Semantics
Computer NetworksComputer Science ApplicationsHealth InformaticsInformation SystemsCommunications
2011English

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
1998English

Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Secluded Path via Shortest Path

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

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

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1990English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy