Complexity and a Heuristic Algorithm of Computing Parallel Degree for Program Nets with SWITCH-Nodes

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]

Authors

Shingo Yamaguchi

This author has not been identified. Look up 'Shingo Yamaguchi' in Google

Tomohiro Takai

This author has not been identified. Look up 'Tomohiro Takai' in Google

Tatsuya Watanabe

This author has not been identified. Look up 'Tatsuya Watanabe' in Google

Qi-Wei Ge

This author has not been identified. Look up 'Qi-Wei Ge' in Google

Minoru Tanaka

This author has not been identified. Look up 'Minoru Tanaka' in Google