A Better Lower Bound on Average Degree of Online k-List-Critical Graphs.

Published in: Electron. J. Comb. (2018)

Keyphrases

average degree
lower bound
phase transition
small world networks
random walk
upper bound
network size
optimal solution
undirected graph
numerical simulations
np hard
objective function
constraint satisfaction
worst case
communication cost
graph mining
minimum cost
small world
search space