A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES

DOI10.1142/S1793830911001371zbMath1251.68168WikidataQ115522593 ScholiaQ115522593MaRDI QIDQ2905281

Wei Ding, Guoliang Xue

Publication date: 27 August 2012

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

divide-and-conquer algorithmmost reliable sourcering-treeunderlying topology

Mathematics Subject Classification ID

Related Items (1)

An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
• A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
• Divide-and-conquer approximation algorithms via spreading metrics
• Reliability covering problems
• Location of facilities on a network subject to a single‐edge failure
• A single facility location problem on a tree with unreliable edges
• A Reliability Model Applied to Emergency Service Vehicle Location

This page was built for publication: A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES