, 1)-total labeling of graphs with a given maximum average degree.

Mickaël Montassier André Raspaud

Published in: J. Graph Theory (2006)

Keyphrases

average degree
phase transition
random walk
small world networks
network size
undirected graph
image segmentation
small world
constraint satisfaction
special case
search space
np hard
theoretical analysis
directed graph
numerical simulations
adjacency matrix