Boosting the exploration of huge dynamic graphs
DOI10.1007/978-3-030-29349-9_7zbMATH Open1436.62218OpenAlexW2981460947MaRDI QIDQ3297380FDOQ3297380
Authors: F. Javier Calle, D. Cuadra, Jesica Rivero, Pedro Isasi 
Publication date: 3 July 2020
Published in: Sampling Techniques for Supervised or Unsupervised Tasks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-29349-9_7
Recommendations
ant colony optimizationdynamic graphshuge graphsbridges of Königsbergdatabase supported metaherusticshuge dynamic graphspath searching methods
Statistical aspects of big data and data science (62R07) Applications of graph theory (05C90) Probabilistic graphical models (62H22)
Cites Work
- A note on two problems in connexion with graphs
- Ant colony optimization.
- Ant colony optimization theory: a survey
- Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
- The small-world phenomenon: an algorithmic perspective
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- A faster approximation algorithm for the Steiner problem in graphs
- Title not available (Why is that?)
- Fast Routing in Road Networks with Transit Nodes
- An improved ant system algorithm for the vehicle routing problem
- Efficient algorithms for updating betweenness centrality in fully dynamic graphs
- High-performance multi-level routing
- Approximate Shortest Path Queries Using Voronoi Duals
Uses Software
This page was built for publication: Boosting the exploration of huge dynamic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297380)
