Rüdiger Reischuk. Approximating Schedules for Dynamic Graphs Efficiently. Electronic Colloquium on Computational Complexity (ECCC), 8(38), 2001. [doi]
@article{ECCC-TR01-038,
title = {Approximating Schedules for Dynamic Graphs Efficiently},
author = {Rüdiger Reischuk},
year = {2001},
url = {http://eccc.hpi-web.de/eccc-reports/2001/TR01-038/index.html},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/ECCC-TR01-038},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {8},
number = {38},
}