Boosting the exploration of huge dynamic graphs

DOI10.1007/978-3-030-29349-9_7MaRDI QIDQ3297380zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• A single-source shortest path algorithm for dynamic graphs
• An all pairs shortest path algorithm for dynamic graphs
• Improving the Exploration Ability of Ant-Based Algorithms
• Optimal directed hypergraph traversal with ant-colony optimisation
• Massive graph analytics

Cites work

• scientific article; zbMATH DE number 1542607 (Why is no real title available?)
• A faster approximation algorithm for the Steiner problem in graphs
• A note on two problems in connexion with graphs
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• An improved ant system algorithm for the vehicle routing problem
• Ant colony optimization theory: a survey
• Ant colony optimization.
• Approximate Shortest Path Queries Using Voronoi Duals
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• Fast Routing in Road Networks with Transit Nodes
• High-performance multi-level routing
• The small-world phenomenon: an algorithmic perspective
• Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP

Describes a project that uses

Uses Software

• DIMACS

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)