Sign in
Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number.
Sebastian Milz
Lutz Volkmann
Published in:
Discret. Math. (2018)
Keyphrases
</>
edge information
undirected graph
connected components
edge detection
database
small number
sufficient conditions
fixed number
maximum number
learning algorithm
information systems
computational complexity
np hard
graph cuts
binary images
weighted graph