4   Artículos

 
en línea
Sanaz Gheibi, Tania Banerjee, Sanjay Ranka and Sartaj Sahni    
This paper proposes a new time-respecting graph (TRG) representation for contact sequence temporal graphs. Our representation is more memory-efficient than previously proposed representations and has run-time advantages over the ordered sequence of edges... ver más
Revista: Algorithms    Formato: Electrónico

 
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

« Anterior     Página: 1 de 1     Siguiente »