Finding all minimum‐size separating vertex sets in a graph

This publication has 26 references indexed in Scilit:

• Efficient parallel triconnectivity in logarithmic time
  Published by Springer Nature ,1988
• Multi-terminal maximum flows in node-capacitated networks
  Discrete Applied Mathematics, 1986
• Calculating bounds on reachability and connectedness in stochastic networks
  Networks, 1983
• A probabilistic algorithm for vertex connectivity of graphs
  Information Processing Letters, 1982
• An O(logn) parallel connectivity algorithm
  Journal of Algorithms, 1982
• A recursive algorithm for finding reliability measures related to the connection of nodes in a graph
  Networks, 1980
• Finding the Vertex Connectivity of Graphs
  SIAM Journal on Computing, 1980
• On the structure of all minimum cuts in a network and applications
  Published by Springer Nature ,1980
• Computing the Reliability of Complex Networks
  SIAM Journal on Applied Mathematics, 1977
• Non-separable and planar graphs
  Transactions of the American Mathematical Society, 1932