Artiom Alhazov, Ion Petre, Vladimir Rogojin. The parallel complexity of signed graphs: Decidability results and an improved algorithm. Theoretical Computer Science, 410(24-25):2308-2315, 2009. [doi]
@article{AlhazovPR09,
title = {The parallel complexity of signed graphs: Decidability results and an improved algorithm},
author = {Artiom Alhazov and Ion Petre and Vladimir Rogojin},
year = {2009},
doi = {10.1016/j.tcs.2009.02.028},
url = {http://dx.doi.org/10.1016/j.tcs.2009.02.028},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/AlhazovPR09},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {410},
number = {24-25},
pages = {2308-2315},
}