Parameterized Complexity of Graph Constraint Logic

@inproceedings{Zanden2015ParameterizedCO,
  title={Parameterized Complexity of Graph Constraint Logic},
  author={Tom C. van der Zanden},
  booktitle={IPEC},
  year={2015}
}
  • Tom C. van der Zanden
  • Published in IPEC 2015
  • Computer Science, Mathematics
  • Graph constraint logic is a framework introduced by Hearn and Demaine, which provides several problems that are often a convenient starting point for reductions. We study the parameterized complexity of Constraint Graph Satisfiability and both bounded and unbounded versions of Nondeterministic Constraint Logic (NCL) with respect to solution length, treewidth and maximum degree of the underlying constraint graph as parameters. As a main result we show that restricted NCL remains PSPACE-complete… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 15 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 15 REFERENCES