{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:41:39Z","timestamp":1781106099761,"version":"3.54.1"},"reference-count":32,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,10,1]]},"abstract":"<p>Software testing is an essential stage of the software development life cycle which helps in producing bug free software. This paper introduces a strategy to create test data consequently from the beginning of test information which is tested against the Program under test (PUT) for ampleness criteria. Initially this process produces test information set arbitrarily where a unique approach for the test path prioritization process is presented that uses the concept of centrality measures. The proposed algorithm computes the importance of each node in the test paths by using various centrality measures and thus identifies the significance of each path. Furthermore, the proposed methodology shows the maximum number of potential nodes that are covered using a less number of prioritized paths. This paper tests the created test information against the product to check its sufficiency.<\/p>","DOI":"10.4018\/ijossp.2016100102","type":"journal-article","created":{"date-parts":[[2017,6,9]],"date-time":"2017-06-09T14:06:11Z","timestamp":1497017171000},"page":"19-38","source":"Crossref","is-referenced-by-count":7,"title":["A Novel Method for Test Path Prioritization using Centrality Measures"],"prefix":"10.4018","volume":"7","author":[{"given":"Amita","family":"Jain","sequence":"first","affiliation":[{"name":"Ambedkar Institute of Advanced Communication Technology and Research, Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Devendra Kumar","family":"Tayal","sequence":"additional","affiliation":[{"name":"Indira Gandhi Delhi Technical University for Women, Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manju","family":"Khari","sequence":"additional","affiliation":[{"name":"Ambedkar Institute of Advanced Communication Technologies and Research, Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sonakshi","family":"Vij","sequence":"additional","affiliation":[{"name":"Indira Gandhi Delhi Technical University for Women, Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJOSSP.2016100102-0","unstructured":"Abran, A., Lopez, M., & Habra, N. (2004). An analysis of the McCabe Cyclomatic complexity number. Proceedings of the 14th International Workshop on Software Measurement (IWSM) IWSM-Metrikon."},{"key":"IJOSSP.2016100102-1","author":"K. K.Aggarwal","year":"2006","journal-title":"Software Engineering"},{"key":"IJOSSP.2016100102-2","doi-asserted-by":"crossref","unstructured":"Briand, L. C., Labiche, Y., & Wang, Y. (2003). An investigation of graph-based class integration test order strategies.IEEE Transactions on Software Engineering, 29(7), 594\u2013607.","DOI":"10.1109\/TSE.2003.1214324"},{"key":"IJOSSP.2016100102-3","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2010.17"},{"key":"IJOSSP.2016100102-4","doi-asserted-by":"publisher","DOI":"10.1145\/1134285.1134299"},{"key":"IJOSSP.2016100102-5","author":"A.Bertolino","year":"2007","journal-title":"Software testing research: Achievements, challenges, dreams. In Proceedings of the 2007 Future of Software Engineering"},{"key":"IJOSSP.2016100102-6","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2007.11.001"},{"issue":"1","key":"IJOSSP.2016100102-7","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1613\/jair.1523","article-title":"LexRank: Graph-based lexical centrality as salience in text summarization.","volume":"22","author":"G.Erkan","year":"2004","journal-title":"Journal of Artificial Intelligence Research"},{"key":"IJOSSP.2016100102-8","article-title":"Computing the shortest path: A search meets graph theory.","author":"A. V.Goldberg","year":"2005).","journal-title":"Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms"},{"key":"IJOSSP.2016100102-9","doi-asserted-by":"publisher","DOI":"10.1504\/IJVSMT.2013.054477"},{"key":"IJOSSP.2016100102-10","doi-asserted-by":"publisher","DOI":"10.1109\/FOSE.2007.29"},{"issue":"2","key":"IJOSSP.2016100102-11","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/2790079","article-title":"Fuzzy Hindi WordNet and Word Sense Disambiguation Using Fuzzy Graph Connectivity Measures.","volume":"15","author":"A.Jain","year":"2016","journal-title":"ACM Transactions on Asian and Low-Resource Language Information Processing"},{"key":"IJOSSP.2016100102-12","doi-asserted-by":"crossref","unstructured":"Jain, A., Mittal, K., & Tayal, D. K. (2014). Automatically incorporating context meaning for query expansion using graph connectivity measures. Progress in Artificial Intelligence, 2(2-3), 129-139.","DOI":"10.1007\/s13748-014-0041-x"},{"key":"IJOSSP.2016100102-13","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2009.23"},{"key":"IJOSSP.2016100102-14","doi-asserted-by":"publisher","DOI":"10.1002\/smr.362"},{"key":"IJOSSP.2016100102-15","unstructured":"Kesharwani, A., & Yadav, C.S. (n. d.). An Optimized APFDC Test Case Prioritization Technique Using PSO."},{"key":"IJOSSP.2016100102-16","unstructured":"Kuhn, D. R., & Reilly, M. J. (2002). An investigation of the applicability of design of experiments to software testing. Proceedings of the 27th Annual Software Engineering Workshop, 2002. NASA Goddard\/IEEE."},{"key":"IJOSSP.2016100102-17","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE.2003.1251065"},{"key":"IJOSSP.2016100102-18","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIC.2013.053045"},{"key":"IJOSSP.2016100102-19","doi-asserted-by":"crossref","unstructured":"Malz, C., & Gohner, P. (2011). Agent-Based Test Case Prioritization. Proceedings of the IEEE Fourth International Conference on Software Testing, Verification and Validation Workshops.","DOI":"10.1109\/ICSTW.2011.81"},{"key":"IJOSSP.2016100102-20","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.36"},{"key":"IJOSSP.2016100102-21","doi-asserted-by":"crossref","unstructured":"Navigli, R., & Lapata, M. (2010). An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation. IEEE Transaction on pattern analysis and machine intelligence, 32(4), 678-392.","DOI":"10.1109\/TPAMI.2009.36"},{"key":"IJOSSP.2016100102-22","unstructured":"Paul, B., Hunter, B., & White, A. (2011) Structural and Functional Testing Techniques \u2013 Differences. Software Testing Times - Tutorials, QTP, Manual Testing Automation Testing, Load Runner. Retrieved from http:\/\/www.softwaretestingtimes.com\/2011\/03\/structural-and-functional-testing.html"},{"key":"IJOSSP.2016100102-23","unstructured":"Tutorials Point. (2017). Path Testing. Retrieved from http:\/\/www.tutorialspoint.com\/software_testing_dictionary\/path_testing.htm"},{"key":"IJOSSP.2016100102-24","doi-asserted-by":"crossref","unstructured":"Qingfeng, D., & Xiao, D. (2011). An improved algorithm for basis path testing. Proceedings of the2011International Conference on Business Management and Electronic Information (Vol. 3). IEEE.","DOI":"10.1109\/ICBMEI.2011.5920422"},{"key":"IJOSSP.2016100102-25","doi-asserted-by":"publisher","DOI":"10.1109\/32.962562"},{"key":"IJOSSP.2016100102-26","article-title":"Augmenting test suites automatically. In","author":"K.Rubinov","year":"2012).","journal-title":"Proceedings of the 2012 International Conference on Software Engineering"},{"key":"IJOSSP.2016100102-27","doi-asserted-by":"publisher","DOI":"10.1145\/566172.566187"},{"key":"IJOSSP.2016100102-28","author":"P.R.Srivastava","year":"2009","journal-title":"Baby, K.M., & Raghurama, G."},{"key":"IJOSSP.2016100102-29","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859100"},{"key":"IJOSSP.2016100102-30","doi-asserted-by":"publisher","DOI":"10.1145\/2480362.2480566"},{"key":"IJOSSP.2016100102-31","doi-asserted-by":"publisher","DOI":"10.1002\/stv.430"}],"container-title":["International Journal of Open Source Software and Processes"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=182782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T19:05:23Z","timestamp":1654110323000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJOSSP.2016100102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2016,10,1]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,10]]}},"URL":"https:\/\/doi.org\/10.4018\/ijossp.2016100102","relation":{},"ISSN":["1942-3926","1942-3934"],"issn-type":[{"value":"1942-3926","type":"print"},{"value":"1942-3934","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,1]]}}}