Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
Year: 2008
Type: conference-paper
Source: Symposium on Discrete Algorithms
Author: Virginia Vassilevska
Institution: Carnegie Mellon University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W1967720682
