The NP-completeness column: An ongoing guide

This publication has 32 references indexed in Scilit:

• Polynomial testing of the query “IS ab ≥ cd?” with application to finding a minimal cost reliability ratio spanning tree
  Discrete Applied Mathematics, 1984
• Large Graphs with Given Degree and Diameter—Part I
  IEEE Transactions on Computers, 1984
• An O(|E|) Time Algorithm for Computing the Reliability of a Class of Directed Networks
  Operations Research, 1984
• Constrained Optimum Communication Trees and Sensitivity Analysis
  SIAM Journal on Computing, 1984
• Calculating bounds on reachability and connectedness in stochastic networks
  Networks, 1983
• On the complexity of finding multi-constrained spanning trees
  Discrete Applied Mathematics, 1983
• The Bounded Path Tree Problem
  SIAM Journal on Algebraic Discrete Methods, 1982
• The complexity of testing whether a graph is a superconcentrator
  Information Processing Letters, 1981
• Complexity of spanning tree problems: Part I
  European Journal of Operational Research, 1980
• On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
  Bell System Technical Journal, 1979