Economical graph discovery

DOI10.1287/OPRE.2014.1313MaRDI QIDQ2941419zbMATH OpenOpenAlexFDO

Authors Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz

Publication date 28 August 2015

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.2014.1313

zbMATH Keywords

shortest pathcongestioncost sharinggraph discovery

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Optimal path discovery problem with homogeneous knowledge
• Graph-Theoretic Concepts in Computer Science
• Network Discovery and Verification with Distance Queries
• Online graph exploration with advice
• Online Graph Exploration: New Results on Old and New Algorithms

Cited in

(3)

• A fault diagnosis method to defend scapegoating attack in network tomography
• Topology discovery of sparse random graphs with few participants
• Optimal path discovery problem with homogeneous knowledge

This page was built for publication: Economical graph discovery

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941419)