1 paper
Nils Kriege, Florian Kurpicz, Petra Mutzel
The complexity of the maximum common connected subgraph problem in partial k-trees is still not fully understood. Polynomial-time solutions are known for degree-bounded outerplan…