Combinatorial Characterisations of Graphical Computational Search Problems

20 Feb 2020 Kayibi Koko Kalambay

A Graphical Search problem, denoted $\Pi(X,\gamma)$, where $X$ is the vertex set or edge set of a graph $G$, consists of finding a solution $Y$, where $Y \subseteq X$ and $Y$ satisfies the predicate $\gamma$. Let $\hat{\Pi}$ be the decision problem associated with $\Pi(X,\gamma)$... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTATIONAL COMPLEXITY