On the Complexity of Local Graph Transformations

C. Scheideler, A. Setzer, 132 (2019) 150:1--150:14.

Download
Restricted LIPIcs-ICALP-2019-150.pdf 537.65 KB
Conference Paper | Published | English
Abstract
We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio.
Publishing Year
Volume
132
Page
150:1--150:14
LibreCat-ID

Cite this

Scheideler C, Setzer A. On the Complexity of Local Graph Transformations. 2019;132:150:1--150:14. doi:10.4230/LIPICS.ICALP.2019.150
Scheideler, C., & Setzer, A. (2019). On the Complexity of Local Graph Transformations. Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICALP.2019.150
@article{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity of Local Graph Transformations}, volume={132}, DOI={10.4230/LIPICS.ICALP.2019.150}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs} }
Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” LIPIcs. Dagstuhl Publishing, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.150.
C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” vol. 132. Dagstuhl Publishing, pp. 150:1--150:14, 2019.
Scheideler, Christian, and Alexander Setzer. On the Complexity of Local Graph Transformations. Vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:10.4230/LIPICS.ICALP.2019.150.
Main File(s)
File Name
LIPIcs-ICALP-2019-150.pdf 537.65 KB
Access Level
Restricted Closed Access
Last Uploaded
2019-08-26T09:21:27Z


Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar