On the computational complexity of the minimum-dummy-activities problem in a pert network.
Maciej M. SysloPublished in: Networks (1984)
Keyphrases
- computational complexity
- network structure
- computer networks
- np complete
- activity recognition
- neural network
- knowledge base
- special case
- link prediction
- peer to peer
- network traffic
- computational efficiency
- team members
- data flow
- network model
- human activities
- complex networks
- database
- computational cost
- search engine
- data mining
- real time