A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges
type: Item
instance of: scholarly article
zbMATH Open document ID: 1251.68168
DOI: 10.1142/S1793830911001371
author: Wei Ding
author: Guoliang Xue
published in: Discrete Mathematics, Algorithms and Applications
publication date: 2012-08-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 65C50
zbMATH DE Number: 6072520
zbMATH Keywords: most reliable source
zbMATH Keywords: ring-tree
zbMATH Keywords: underlying topology
zbMATH Keywords: divide-and-conquer algorithm
Wikidata QID: Q115522593
MaRDI profile type: Publication
cites work: A Reliability Model Applied to Emergency Service Vehicle Location
cites work: Reliability covering problems
cites work: Q3097395
cites work: A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
cites work: A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
cites work: Location of facilities on a network subject to a single‐edge failure
cites work: Divide-and-conquer approximation algorithms via spreading metrics
cites work: A single facility location problem on a tree with unreliable edges
cites work: Q3999466
cites work: Q4355484
title: A divide-and-conquer algorithm for finding a most reliable source on a ring-embedded tree network with unreliable edges
description: scientific article; zbMATH DE number 6072520