Acyclic networks maximizing the printing complexity.

Franck Guingne Florent Nicart André Kempe

Published in: Theor. Comput. Sci. (2004)

Keyphrases

network size
social networks
worst case
low cost
np hard
network structure
computer networks
network analysis
neural network
computational complexity
np complete
bounded treewidth
case study
power law
network design
complexity analysis
high speed
search algorithm
digital images
computational cost
lower bound