Color Coding is an algorithmic technique for deciding efficiently if a given input graph contains a path of a given length (or another small subgraph of constant tree-width). Applications of the method in computational biology motivate the study of similar algorithms for counting the number of copies of a given ... more >>>

The domination number of a graph $G=(V,E)$ is the minimum size of a dominating set $U \subseteq V$, which satisfies that every vertex in $V \setminus U$ is adjacent to at least one vertex in $U$. The notion of a problem kernel refers to a polynomial time algorithm that achieves ... more >>>