Login / Signup

Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets.

Ankit AbhinavSusobhan BandopadhyayAritra BanikYasuaki KobayashiShunsuke NaganoYota OtachiSaket Saurabh
Published in: MFCS (2022)
Keyphrases
  • parameterized complexity
  • databases
  • shortest path
  • global constraints
  • fixed parameter tractable
  • knowledge base
  • np hard
  • approximation algorithms