scientific article; zbMATH DE number 6783473
From MaRDI portal
Publication:5365121
zbMath1376.05154arXiv1007.2216MaRDI QIDQ5365121
Publication date: 29 September 2017
Full work available at URL: https://arxiv.org/abs/1007.2216
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (8)
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter ⋮ Unnamed Item ⋮ Bulk-robust combinatorial optimization ⋮ Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles ⋮ An Experimental Study on Approximating k Shortest Simple Paths ⋮ Incremental distance products via faulty shortest paths ⋮ Sparse Weight Tolerant Subgraph for Single Source Shortest Path ⋮ Unnamed Item
This page was built for publication:
