Boosting the Exploration of Huge Dynamic Graphs

DOI10.1007/978-3-030-29349-9_7zbMath1436.62218OpenAlexW2981460947MaRDI QIDQ3297380

Dolores Cuadra, F. Javier Calle, 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

zbMATH Keywords

ant colony optimizationdynamic graphshuge graphsbridges of Königsbergdatabase supported metaherusticshuge dynamic graphspath searching methods

Mathematics Subject Classification ID

Applications of graph theory (05C90) Probabilistic graphical models (62H22) Statistical aspects of big data and data science (62R07)

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• An improved ant system algorithm for the vehicle routing problem
• Ant colony optimization theory: a survey
• Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP
• Approximate Shortest Path Queries Using Voronoi Duals
• Fast Routing in Road Networks with Transit Nodes
• The small-world phenomenon
• A faster approximation algorithm for the Steiner problem in graphs

This page was built for publication: Boosting the Exploration of Huge Dynamic Graphs