A Lower Bound Study on Software Development Effort
This paper depicts a study on the lower bound of software development effort. The work begins with the transformation model which is with the popular software development lifecycle. In general, a combination of properly handled transformations can ultimately produce the software, and the transformations form the path of software development. Each transformation is associated with its effort, or the weight, in a path. There can be a number of these paths since many different methods and tools can be used or reused for a specific software development case. Then, the Shortest Path algorithm is applied to find a shortest path which is with a minimal total effort among all the paths.