Indian Journal of Science and Technology
Year: 2016, Volume: 9, Issue: 48, Pages: 1-6
Anuja Bokhare1*, P. S. Metkewar1 and R. S. Walse2
1 Symbiosis Institute of Computer Studies and Research (SICSR), A Constituent of Symbiosis International University (SIU), Atur Centre, Gokhale Cross Road, Model Colony, Pune - 411016, Maharashtra, India; [email protected]
2 College of Dairy technology, Pusad, Affiliated to MAFSU, Nagpur - 440006, Maharashtra, India; [email protected], [email protected]
Objective: Nature of the problem is always solvable, partially solvable or unsolvable but by using certain techniques we may resolve uncertainty up to some extent. This study evaluates Graph Theory (GT) concepts, in order to resolve its complexity by applying use case analysis method and helps to classify them. Methods/Statistical Analysis: Experiment has been formulated on 38 GT concepts. For each GT concept identification of use cases and its corresponding activities is performed. Further, proposed method helps in classifying the problem. Findings: In this paper rule based random sampling technique for use case analysis is being proposed. It helps to compute required number of use cases for solving graph theory related problems and to categorize them into simple, moderate or complex classes. In order to achieve this, proposed work deals with identifying use cases, activities in each use case, classification of activities in terms of simple, moderate and complex classes. Novelty/Improvement: Computation of problem length (PL) through proposed rule based random sampling helps in classification of problem. Classifying the problem helps to reduce its complexity. Proposed classification method/process achieves the same.
Keywords: Graph Theory (GT) Concepts, Rule Based Random Sampling, Use Cases
Subscribe now for latest articles and news.