Gathering information in a graph

MaRDI QIDQ5298901zbMATH OpenFDO

Authors Laurent Beaudou, Roland Grappe, Geňa Hahn

Publication date 25 June 2013

zbMATH Keywords

graph theoryinformation gatheringlower boundsupper bounds

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Information gathering in ad-hoc radio networks
• Information gathering in ad-hoc radio networks with tree topology
• Optimal gathering in radio grids with interference
• GATHERING RADIO MESSAGES IN THE PATH
• Information flows on hypergraphs

Cited in

(1)

• scientific article; zbMATH DE number 6385 (Why is no real title available?)

This page was built for publication: Gathering information in a graph

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