A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree

DOI10.1007/978-3-642-17461-2_22zbMath1311.90023OpenAlexW1796720346WikidataQ62043111 ScholiaQ62043111MaRDI QIDQ3066464

Guoliang Xue, Wei Ding

Publication date: 10 January 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-17461-2_22

zbMATH Keywords

divide-and-conquer algorithmmost reliable sourcering-treeunderlying topology

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Graph algorithms (graph-theoretic aspects) (05C85)