A divide-and-conquer algorithm for computing a most reliable source on an unreliable ring-embedded tree

DOI10.1007/978-3-642-17461-2_22MaRDI QIDQ3066464zbMATH OpenOpenAlexWikidataFDO

Authors Wei Ding, Guoliang Xue

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

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

Recommendations

• A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges
• A fast parallel algorithm for finding a most reliable source on a general ring-tree graph with unreliable edges
• A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices
• A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
• On the 2-MRS problem in a tree with unreliable edges

Cited in

(3)

• A fast parallel algorithm for finding a most reliable source on a general ring-tree graph with unreliable edges
• A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges
• An edge-turbulence algorithm for the 2-MRS problem on trees with unreliable edges

This page was built for publication: A divide-and-conquer algorithm for computing a most reliable source on an unreliable ring-embedded tree

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