Work

Minimum time-dependent cost path

Year: 2004

Type: conference-paper

Source: HAL

Author: Hendel, Yann

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W3114137233

FWCI:

Cites:

Cited by:

Related to: 10