The Average Degree of Minimally Contraction-Critically 5-Connected Graphs.

Kiyoshi Ando Yoshimi Egawa Matthias Kriesell

Published in: J. Graph Theory (2014)

Keyphrases

average degree
connected graphs
phase transition
network size
random walk
small world networks
markov random field
closed form
image processing
np complete
undirected graph
neural network
computational complexity
constraint satisfaction
approximation algorithms
small world