Back to Results
First PageMeta Content
Network theory / Search algorithms / Shortest path problem / Network flow / Routing algorithms / Breadth-first search / Graph / Shortest path tree / Flow network / Mathematics / Graph theory / Theoretical computer science


Arc-Flags in Dynamic Graphs⋆ Emanuele Berrettini1 , Gianlorenzo D’Angelo1 , and Daniel Delling2 1
Add to Reading List

Document Date: 2009-08-27 08:25:24


Open Document

File Size: 168,15 KB

Share Result on Facebook

Company

Western European / /

Country

Germany / Netherlands / Italy / Luxembourg / /

/

Facility

University of L’Aquila / /

IndustryTerm

real-world applications / route planning algorithms / backward search / road network / easy query algorithm / edges %mot road network / shortest paths algorithm / road networks / forward search / time-dependent dynamic road networks / railway networks / travel time / travel times / breadth-first search / transportation network / online phase / minimal travel time route / dynamic road networks / transportation networks / real world road networks / breadthfirst search / static route planning algorithms / /

OperatingSystem

SuSE Linux / GNU / /

Organization

University of L’Aquila / Department of Electrical and Information Engineering / Future and Emerging Technologies Unit of EC / Faculty of Informatics / /

/

Technology

dynamic algorithm / static route planning algorithms / shortest paths algorithm / 3 Dynamic Algorithm / Linux / ALT algorithm / 1 Algorithm / route planning algorithms / AMD opteron Processor / two algorithms / easy query algorithm / /

SocialTag