Finding small-width connected path decompositions in polynomial time.

Dariusz Dereniowski Dorota Osula Pawel Rzazewski

Published in: CoRR (2018)

Keyphrases

computational complexity
special case
databases
genetic algorithm
small number
database
machine learning
social networks
case study
shortest path
endpoints
strongly connected
randomly distributed