Fixed-parameter algorithms for graph constraint logic

HIGHLIGHTS

• who: Tatsuhiko Hatanaka and colleagues from the JapanJapanGraduate School of Information Sciences, Tohoku University, Sendai, Japan have published the research work: Fixed-Parameter Algorithms for Graph Constraint Logic, in the Journal: (JOURNAL)
• what: The authors show that NCL is tractable (FPT) for any of these parameters. The authors investigate the possibility of obtaining a further strengthening by restricting the composition of the constraint graph. The authors show that C2C and C2E parameterized by the number of and vertices or the number of or vertices admits an FPT algorithm. The authors show that slightly modified reduction . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.