scientific article; zbMATH DE number 7310193

zbMath1490.05256arXiv1308.1568MaRDI QIDQ5150562

A. R. Urakov, T. V. Timeryaev

Publication date: 15 February 2021

Full work available at URL: https://arxiv.org/abs/1308.1568

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

sparse graphsgraph assemblyAPSPgraph disassembly

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• DIMACS
• Algorithm 97

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• On a routing problem
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Efficient Algorithms for Shortest Paths in Sparse Networks

This page was built for publication: