Login / Signup

Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs.

Petr A. GolovachFahad PanolanAshutosh RaiSaket Saurabh
Published in: CSR (2022)
Keyphrases
  • undirected graph
  • disjoint paths
  • directed graph
  • parameterized complexity
  • search algorithm
  • graphical models
  • np complete