Optimization and Prioritization of Test Cases through the Hungarian Algorithm

Kumar, Hemant and Saxena, Vipin (2025) Optimization and Prioritization of Test Cases through the Hungarian Algorithm. Journal of Advances in Mathematics and Computer Science, 40 (3). pp. 61-72. ISSN 2456-9968

Full text not available from this repository.

Abstract

Test cases play a significant role in developing high-quality and reliable software products. Efficient test case generation and optimization are essential to minimize testing time and ensure comprehensive coverage of software modules. This paper proposes a novel approach to test case optimization and prioritization using the Hungarian algorithm, which systematically assigns test cases to minimize execution time and enhance testing efficiency. Initially, test cases are generated and classified as valid or invalid, with only valid test cases being prioritized for execution. The proposed method is adaptable to various software testing strategies, making it applicable across different domains. The effectiveness of this approach is demonstrated through computed results presented in tabular and graphical formats, showing significant improvements in test execution efficiency.

Item Type: Article
Subjects: Open Asian Library > Mathematical Science
Depositing User: Unnamed user with email support@openasianlibrary.com
Date Deposited: 31 Mar 2025 09:59
Last Modified: 01 Apr 2025 12:28
URI: http://conference.peerreviewarticle.com/id/eprint/2237

Actions (login required)

View Item
View Item