Login / Signup

The number of cut-vertices in a graph of given minimum degree.

Michael O. AlbertsonDavid M. Berman
Published in: Discret. Math. (1991)
Keyphrases
  • weighted graph
  • random graphs
  • neural network
  • connected graphs
  • optimal solution
  • small number
  • undirected graph
  • minimum cut
  • directed edges
  • markov random field
  • directed graph
  • edge weights