A framework for network reliability problems on graphs of bounded treewidth

DOI10.1007/3-540-36136-7_13MaRDI QIDQ4425949zbMATH OpenFDO

Authors Thomas Wolle

Publication date 14 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2518/25180137.htm, https://dspace.library.uu.nl/handle/1874/24037

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reliability, availability, maintenance, inspection in operations research (90B25) Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Recommendations

• Exact methods to compute network reliability
• Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs
• Computing residual connectedness reliability for restricted networks
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• scientific article; zbMATH DE number 4060712

Cited in

(5)

• Multiple facility location on a network with linear reliability order of edges
• On the 2-MRS problem in a tree with unreliable edges
• Tree decompositions of graphs: saving memory in dynamic programming
• scientific article; zbMATH DE number 1337741 (Why is no real title available?)
• Linking-Centers and Reliable-Trees of a Network

This page was built for publication: A framework for network reliability problems on graphs of bounded treewidth

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