Experimental algorithms. 6th international workshop, WEA 2007, Rome, Italy, June 6--8, 2007. Proceedings.
From MaRDI portal
Publication:2455905
DOI10.1007/978-3-540-72845-0zbMath1121.68003WikidataQ56384699 ScholiaQ56384699MaRDI QIDQ2455905
No author found.
Publication date: 16 October 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72845-0
68Wxx: Algorithms in computer science
00B25: Proceedings of conferences of miscellaneous specific interest
68-06: Proceedings, conferences, collections, etc. pertaining to computer science
Related Items
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks, Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter, Mvtree for hierarchical network representation based on geometric algebra subspace, Energy-optimal routes for battery electric vehicles, Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates, The Shortcut Problem – Complexity and Approximation