Graph Based CIA in Requirements Engineering

Maninder Singh, Vaibhav Anu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

We developed a novel Vertical Breadth-First Search All-path graph algorithm that utilizes vertical data structures to find all-length paths (including shortest paths) for all pairs of vertices in a graph. In the current research we propose an approach to apply our All-path algorithm to perform Change Impact Analysis during Requirements Engineering. This article presents a roadmap of our future research plan to apply our All-path algorithm for software quality improvement.

Original languageEnglish
Title of host publicationProceedings - 2020 IEEE International Conference on Big Data, Big Data 2020
EditorsXintao Wu, Chris Jermaine, Li Xiong, Xiaohua Tony Hu, Olivera Kotevska, Siyuan Lu, Weijia Xu, Srinivas Aluru, Chengxiang Zhai, Eyhab Al-Masri, Zhiyuan Chen, Jeff Saltz
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages5828-5830
Number of pages3
ISBN (Electronic)9781728162515
DOIs
StatePublished - 10 Dec 2020
Event8th IEEE International Conference on Big Data, Big Data 2020 - Virtual, Atlanta, United States
Duration: 10 Dec 202013 Dec 2020

Publication series

NameProceedings - 2020 IEEE International Conference on Big Data, Big Data 2020

Conference

Conference8th IEEE International Conference on Big Data, Big Data 2020
CountryUnited States
CityVirtual, Atlanta
Period10/12/2013/12/20

Fingerprint

Dive into the research topics of 'Graph Based CIA in Requirements Engineering'. Together they form a unique fingerprint.

Cite this