Computing residual connectedness reliability for restricted networks

This publication has 13 references indexed in Scilit:

• Permutation Graphs: Connected Domination and Steiner Trees
  Published by Elsevier ,1991
• Linear time algorithms for NP-hard problems restricted to partial k-trees
  Discrete Applied Mathematics, 1989
• Computing 2-terminal reliability for radio-broadcast networks
  IEEE Transactions on Reliability, 1989
• The Complexity of Reliability Computations in Planar and Acyclic Graphs
  SIAM Journal on Computing, 1986
• A Linear Recognition Algorithm for Cographs
  SIAM Journal on Computing, 1985
• Domination in permutation graphs
  Journal of Algorithms, 1985
• Finding minimum dominating cycles in permutation graphs
  Operations Research Letters, 1985
• Transitive orientation in 0(n²) time
  Published by Association for Computing Machinery (ACM) ,1983
• Complement reducible graphs
  Discrete Applied Mathematics, 1981
• A recognition algorithm for the intersection graphs of directed paths in directed trees
  Discrete Mathematics, 1975