Browsing SoAS - Theses and Dissertations by Subject "Computational complexity"

Now showing items 1-3 of 3

Correlation Clustering via s-Club Cluster Edge Deletion

Makarem, Norma (Lebanese American University, 2023-05-19)

Cluster Editing, a known model for correlation clustering, has garnered significant consideration in the parameterized complexity area and has been utilized in a range of practical contexts. In certain situations, the ...
On the steiner walk problem. (c2009)

Maarouf, Amina (Lebanese American University, 2011-10-24)

Given a Euclidean graph G = (Y, E) with a special set of vertices, called the terminal s, the Euclidean Steiner Walk problem asks for a walk through the vertices of the graph that starts and ends at a particular point, ...
Reduction-based methods and metrics for selective regression testing. (c2000)

Bahsoon, Rami K. (Lebanese American University, 2011-10-14)

Selective regression testing attempts to choose an appropriate subset of test cases from among a previously run test suite for a software system, based on information about the changes made to the system to create new ...

Now showing items 1-3 of 3

Search LAUR