Steiner trees, partial 2–trees, and minimum IFI networks

This publication has 12 references indexed in Scilit:

• Some simplified NP-complete graph problems
  Published by Elsevier ,2002
• Networks immune to isolated failures
  Networks, 1981
• Computation of the center and diameter of outerplanar graphs
  Discrete Applied Mathematics, 1980
• The subgraph homeomorphism problem
  Published by Association for Computing Machinery (ACM) ,1978
• The Rectilinear Steiner Tree Problem is $NP$-Complete
  SIAM Journal on Applied Mathematics, 1977
• On simple characterizations of k-trees
  Discrete Mathematics, 1974
• On the design of reliable networks
  Networks, 1973
• Depth-First Search and Linear Graph Algorithms
  SIAM Journal on Computing, 1972
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• Steiner's problem in graphs and its implications
  Networks, 1971