2   Artículos

« Anterior     Página: 1 de 1     Siguiente »

 
en línea
Shalini Sharma and Jerry Chou    
In time-evolving graphs, the graph changes at each time interval, and the previously computed results become invalid. We addressed this issue for the traveling salesman problem (TSP) in our previous work and proposed an incremental algorithm where the TS... ver más
Revista: Algorithms    Formato: Electrónico

 
en línea
Mattia D?Emidio    
Computing shortest-path distances is a fundamental primitive in the context of graph data mining, since this kind of information is essential in a broad range of prominent applications, which include social network analysis, data routing, web search opti... ver más
Revista: Algorithms    Formato: Electrónico

« Anterior     Página: 1 de 1     Siguiente »