Shingo Yamaguchi, Tomohiro Takai, Tatsuya Watanabe, Qi-Wei Ge, Minoru Tanaka. Complexity and a Heuristic Algorithm of Computing Parallel Degree for Program Nets with SWITCH-Nodes. IEICE Transactions, 89-A(11):3207-3215, 2006. [doi]
@article{YamaguchiTWGT06,
title = {Complexity and a Heuristic Algorithm of Computing Parallel Degree for Program Nets with SWITCH-Nodes},
author = {Shingo Yamaguchi and Tomohiro Takai and Tatsuya Watanabe and Qi-Wei Ge and Minoru Tanaka},
year = {2006},
doi = {10.1093/ietfec/e89-a.11.3207},
url = {http://dx.doi.org/10.1093/ietfec/e89-a.11.3207},
tags = {parallel programming},
researchr = {https://researchr.org/publication/YamaguchiTWGT06},
cites = {0},
citedby = {0},
journal = {IEICE Transactions},
volume = {89-A},
number = {11},
pages = {3207-3215},
}