On Routing Disjoint Paths in Bounded Treewidth Graphs.

Alina Ene Matthias Mnich Marcin Pilipczuk Andrej Risteski

Published in: SWAT (2016)

Keyphrases

bounded treewidth
disjoint paths
np complete
decision problems
conjunctive queries
approximation algorithms
highly parallelizable
undirected graph
directed graph
boolean functions
shortest path
np hard
query answering
complex networks
phase transition
directed acyclic graph
random walk
database systems