"Complexity and a Heuristic Algorithm of Computing Parallel Degree for ..."

Shingo Yamaguchi et al. (2006)

> Home

Details and statistics

DOI: 10.1093/IETFEC/E89-A.11.3207

access: closed

type: Journal Article

metadata version: 2020-04-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ieicet/YamaguchiTWGT06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/YamaguchiTWGT06
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 Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(11): 3207-3215 (2006)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.