Computing residual connectedness reliability for restricted networks
type: Item
instance of: scholarly article
title: Computing residual connectedness reliability for restricted networks
zbMATH Open document ID: 0780.90047
DOI: 10.1016/0166-218X(93)90233-E
author: Charles J. Colbourn
author: A. Satyanarayana
author: Charles L. Suffel
author: K. Sutner
published in: Discrete Applied Mathematics
publication date: 1993-11-28T00:00:00Z
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90B25
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 90B15
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 428114
zbMATH Keywords: probabilistic network
zbMATH Keywords: connected graph
zbMATH Keywords: residual node connectedness reliability
zbMATH Keywords: reliability measure
zbMATH Keywords: polynomial time algorithms
MaRDI profile type: Publication
cites work: Computing 2-terminal reliability for radio-broadcast networks
cites work: Efficient algorithms for computing the reliability of permutation and interval graphs
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: Finding minimum dominating cycles in permutation graphs
cites work: Permutation graphs: Connected domination and Steiner trees
cites work: Complement reducible graphs
cites work: A Linear Recognition Algorithm for Cographs
cites work: Domination in permutation graphs
cites work: A recognition algorithm for the intersection graphs of directed paths in directed trees
cites work: The Complexity of Reliability Computations in Planar and Acyclic Graphs
cites work: The Complexity of the Residual Node Connectedness Reliability Problem
cites work: The Complexity of Enumeration and Reliability Problems
cites work: Steiner trees, partial 2–trees, and minimum IFI networks
full work available at URL: 0166-218x(93)90233-e
OpenAlex ID: W2066629848
description: scientific article; zbMATH DE number 428114