arXiv (All)open access
Local Representatives and Shortest Completions for Next-to-Shortest Paths in Directed Graphs
data structures and algorithms, discrete mathematics, 68w40, 05c85, 05c38, f.2.2; g.2.2
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 1037623
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.