Florian Werner

collaborators

2 papers

cs.DS2024

Induced Subforests and Superforests

Dieter Rautenbach, Florian Werner

Graph isomorphism, subgraph isomorphism, and maximum common subgraphs are classical well-investigated objects. Their (parameterized) complexity and efficiently tractable cases have…

cs.DS2024

Largest common subgraph of two forests

Dieter Rautenbach, Florian Werner

A common subgraph of two graphs $G_{1}$ and $G_{2}$ is a graph that is isomorphic to subgraphs of $G_{1}$ and $G_{2}$ . In the largest common subgraph problem the task is to determine a com…