Old Web
English
Sign In
Acemap
>
Paper
>
Formulation of Mobile Agent Allocation and Its Strong NP-Completeness(Complexity Theory)
Formulation of Mobile Agent Allocation and Its Strong NP-Completeness(Complexity Theory)
2005
Atsushi Sasaki
Tadashi Araragi
Shigeru Masuyama
Keizo Miyata
Keywords:
Completeness (order theory)
Mobile agent
Subgraph isomorphism problem
Theoretical computer science
Computer science
Load balancing (computing)
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]