Alexander Setzer

activity

20122019

most citedThe planar minimum linear arrangement problem is different from the minimum linear arrangement problem

1 citations · 3 across the 8 of their papers we have counts for

collaborators

Showing 2019 · cs.DCShow all

1 paper · 2 filters

cs.DC2019

On the Complexity of Local Graph Transformations

Christian Scheideler, Alexander Setzer

We consider the problem of transforming a given graph $G_{s}$ into a desired graph $G_{t}$ by applying a minimum number primitives from a particular set of local graph transformation p…