Efficient algorithms for computing the reliability of permutation and interval graphs

This publication has 19 references indexed in Scilit:

• Linear time algorithms for NP-hard problems restricted to partial k-trees
  Discrete Applied Mathematics, 1989
• Steiner trees, connected domination and strongly chordal graphs
  Networks, 1985
• Steiner trees, partial 2–trees, and minimum IFI networks
  Networks, 1983
• Complement reducible graphs
  Discrete Applied Mathematics, 1981
• The complexity of computing the permanent
  Theoretical Computer Science, 1979
• The Rectilinear Steiner Tree Problem is $NP$-Complete
  SIAM Journal on Applied Mathematics, 1977
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
  Journal of Computer and System Sciences, 1976
• The intersection graphs of subtrees in trees are exactly the chordal graphs
  Journal of Combinatorial Theory, Series B, 1974
• Network reliability analysis: Part I
  Networks, 1971
• Incidence matrices and interval graphs
  Pacific Journal of Mathematics, 1965