arXiv (All)
open access
Local Representatives and Shortest Completions for Next-to-Shortest Paths in Directed Graphs
Given a directed graph with positive edge weights and two vertices s,t, a next-to-shortest s-t path is a shortest simple s-t path among those whose length is strictly larger than the shortest-path distance. The problem was introduced by Lalgudi, Papaefthymiou and Potkonjak in 1996; it is NP-hard whe
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Polynomial Lower Bounds for Distributed Graph Sketching with Tiny Error: Connectivity and Spanning Tree Construction#973425
- Navigating Small-World Networks with Distance Predictions#997858
- On the extrema of the mean subtree order of graphs#1013436
- HyperGraph and SuperHyperGraph Theory with Applications (VIII): Hierarchical SuperHyperGraph, Recursive SuperHyperGraph, and Related Graph Theory#694355
- Proper conflict-free choosability of sparse graphs with girth at least seven#998793
Record · ID 1037623
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive