Engineering Exact Quasi-Threshold Editing

Lars Gottesbüren, Michael Hamann, Philipp Schoch +3

Quasi-threshold graphs are $\{C_4,P_4\}$-free graphs, i.e., they do not contain any cycle or path of four nodes as an induced subgraph. We study the $\{C_4,P_4\}$-free editing pr…