Login / Signup

Degree sequence conditions for maximally edge-connected graphs and digraphs.

Peter DankelmannLutz Volkmann
Published in: J. Graph Theory (1997)
Keyphrases
  • connected graphs
  • sufficient conditions
  • edge information
  • undirected graph
  • neural network
  • computer vision
  • markov random field
  • directed graph
  • edge detector
  • environmental conditions
  • power law
  • multiple scales