Distributed graph algorithms for computer networks

DOI10.1007/978-1-4471-5173-9MaRDI QIDQ355058zbMATH OpenOpenAlexFDO

Authors Kayhan Erciyes

Publication date 23 July 2013

Published in Computer Communications and Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4471-5173-9

zbMATH Keywords

spanning treesgraph algorithmsdistributed systemsdominating setsroutingself-stabilizationvertex coverwireless sensor networksmobile ad hoc networksfault tolerant clustering

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Distributed algorithms. An intuitive approach
• scientific article; zbMATH DE number 53191
• Algorithmische Graphentheorie
• Distributed graph algorithms and their complexity: an introduction
• Design and Analysis of Distributed Algorithms

Cited in

(3)

• Distributed graph algorithms and their complexity: an introduction
• Distributed computing of efficient routing schemes in generalized chordal graphs
• Distributed algorithms. An intuitive approach

This page was built for publication: Distributed graph algorithms for computer networks

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