Finding small-width connected path decompositions in polynomial time.

Dariusz Dereniowski Dorota Osula Pawel Rzazewski

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

Keyphrases

special case
small number
connected components
neural network
social networks
shortest path
data structure
computational complexity
evolutionary algorithm
endpoints
randomly distributed