{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:17Z","timestamp":1750308737203,"version":"3.41.0"},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2013,11,11]],"date-time":"2013-11-11T00:00:00Z","timestamp":1384128000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSOFT Softw. Eng. Notes"],"published-print":{"date-parts":[[2013,11,11]]},"abstract":"<jats:p>Every regression testing cycle of a software application results in new test cases being introduced in a test suite. Many test cases from previous regression testing cycles become unstable or unusable due to the removal\/addition of the new functionalities. The execution of a large number of unusable test cases results in less test coverage and higher test execution time. The lower test coverage is due to the coverage of the non-existent code statements. The higher test execution time is due to the execution of unused and broken test cases. In this paper, we propose a new bipartite graph approach to eliminate the subset of test cases that are not relevant for the testing of the current version of a software application. The suggested approach helps in executing a minimal set of test cases that are required to cover more code statements.<\/jats:p>","DOI":"10.1145\/2532780.2532806","type":"journal-article","created":{"date-parts":[[2013,11,27]],"date-time":"2013-11-27T14:13:59Z","timestamp":1385561639000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A novel bipartite graph approach for selection and prioritisation of test cases"],"prefix":"10.1145","volume":"38","author":[{"given":"Deepak","family":"Garg","sequence":"first","affiliation":[{"name":"The University of Western Australia, Perth, Australia"}]},{"given":"Amitava","family":"Datta","sequence":"additional","affiliation":[{"name":"The University of Western Australia, Perth, Australia"}]},{"given":"Tim","family":"French","sequence":"additional","affiliation":[{"name":"The University of Western Australia, Perth, Australia"}]}],"member":"320","published-online":{"date-parts":[[2013,11,11]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"42","volume-title":"R. Abreu, H.-G. Gross, and A. J. C. van Gemund. Prioritizing tests for software fault diagnosis. In Software: Practice and Experience","author":"Gonzalez-Sanchez A.","year":"2011","unstructured":"A. Gonzalez-Sanchez , r. Piel , R. Abreu, H.-G. Gross, and A. J. C. van Gemund. Prioritizing tests for software fault diagnosis. In Software: Practice and Experience , pages 42 -- 51 . John Wiley & Sons, Ltd. , April 2011 . 10.1002\/spe.1065 A. Gonzalez-Sanchez, r. Piel, R. Abreu, H.-G. Gross, and A. J. C. van Gemund. Prioritizing tests for software fault diagnosis. In Software: Practice and Experience, pages 42--51. John Wiley & Sons, Ltd., April 2011. 10.1002\/spe.1065"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2012.26"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/504311.504305"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1971.1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2012.131"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.536955"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/1099-1689(200006)10:2<77::AID-STVR197>3.0.CO;2-E"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.962562"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2008.42"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISESE.2005.1541815"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSACW.2011.32"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/QSIC.2010.33"}],"container-title":["ACM SIGSOFT Software Engineering Notes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2532780.2532806","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2532780.2532806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:06Z","timestamp":1750278126000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2532780.2532806"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,11]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11,11]]}},"alternative-id":["10.1145\/2532780.2532806"],"URL":"https:\/\/doi.org\/10.1145\/2532780.2532806","relation":{},"ISSN":["0163-5948"],"issn-type":[{"type":"print","value":"0163-5948"}],"subject":[],"published":{"date-parts":[[2013,11,11]]},"assertion":[{"value":"2013-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}