4   Artículos

 
en línea
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
Revista: Algorithms    Formato: Electrónico

 
en línea
Pierluigi Crescenzi, Clémence Magnien and Andrea Marino    
Temporal networks are graphs in which edges have temporal labels, specifying their starting times and their traversal times. Several notions of distances between two nodes in a temporal network can be analyzed, by referring, for example, to the earliest ... ver más
Revista: Algorithms    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »