A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
type: Item
instance of: scholarly article
title: A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges
zbMATH Open document ID: 0915.68081
DOI: 10.1016/S0304-3975(97)00124-2
author: Charles J. Colbourn
author: Guoliang Xue
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1238701
zbMATH Keywords: algorithms
zbMATH Keywords: time complexity
zbMATH Keywords: partial 2-trees
zbMATH Keywords: series-parallel graph
zbMATH Keywords: network reliability
MaRDI profile type: Publication
cites work: Q3056948
cites work: A Reliability Model Applied to Emergency Service Vehicle Location
cites work: Reliability covering problems
cites work: The Maximal Expected Covering Location Problem: Revisited
cites work: Q5422499
cites work: Location of facilities on a network subject to a single‐edge failure
cites work: Networks immune to isolated failures
cites work: A single facility location problem on a tree with unreliable edges
cites work: Q3358523
cites work: Locating A Broadcast Facility In An Unreliable Network
cites work: The Maximum Availability Location Problem
cites work: On simple characterizations of k-trees
cites work: Q3999466
cites work: Q4229605
cites work: Steiner trees, partial 2–trees, and minimum IFI networks
cites work: Q4355484
full work available at URL: s0304-3975(97)00124-2
OpenAlex ID: W2072715079
description: scientific article; zbMATH DE number 1238701