"Complexity of Task Graph Scheduling with Fixed Communication Capacity."

Lucian Finta, Zhen Liu (1997)

> Home

Details and statistics

DOI: 10.1142/S0129054197000045

access: closed

type: Journal Article

metadata version: 2024-07-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijfcs/FintaL97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/FintaL97
Lucian Finta, Zhen Liu:
Complexity of Task Graph Scheduling with Fixed Communication Capacity. Int. J. Found. Comput. Sci. 8(1): 43-66 (1997)

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.