A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges

DOI10.1007/978-3-642-22616-8_9zbMath1342.68253OpenAlexW2293346702WikidataQ62043107 ScholiaQ62043107MaRDI QIDQ5199143

Guoliang Xue, Wei Ding

Publication date: 12 August 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22616-8_9

zbMATH Keywords

parallel algorithmmost reliable sourcecomplementary dynamic programminggeneral ring-tree graph

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Weighted cache location problem with identical servers