3-path in graphs with bounded average degree.

Stanislav Jendrol'Mária Maceková Mickaël Montassier Roman Soták

Published in: Discuss. Math. Graph Theory (2016)

Keyphrases

average degree
phase transition
random walk
small world networks
network size
undirected graph
shortest path
numerical simulations
communication cost
minimum cost
markov chain
cellular automata
constraint satisfaction
adjacency matrix