|
|
|
|
|
Anuj Jain and Sartaj Sahni
The min-wait foremost, min-hop foremost and min-cost foremost paths and walks problems in interval temporal graphs are considered. We prove that finding min-wait foremost and min-cost foremost walks and paths in interval temporal graphs is NP-hard. We de...
ver más
|
|
|
|
|