Fixed-Parameter Complexity of Minimum Profile Problems

Gregory Gutin, Stefan Szeider, Anders Yeo

Let $G=(V,E)$ be a graph. An ordering of $G$ is a bijection $α: V\dom \{1,2,..., |V|\}.$ For a vertex $v$ in $G$, its closed neighborhood is $N[v]=\{u\in V:uv\in E\}\cup \{v\}.$ T…