.

Browsing SoAS - Scholarly Publications by Author "Samatova, Nagiza F."

LAUR Repository

Browsing SoAS - Scholarly Publications by Author "Samatova, Nagiza F."

Sort by: Order: Results:

  • The buffered work-pool approach for search-tree based optimization algorithms 
    Abu-Khzam, Faisal N.; Rizk, Mohamad A.; Abdallah, Deema A.; Samatova, Nagiza F. (Springer, 2017-03-17)
    Recent advances in algorithm design have shown a growing interest in seeking exact solutions to many hard problems. This new trend has been motivated by hardness of approximation results that appeared in the last decade, ...
  • The maximum common subgraph problem 
    Abu-Khzam, Faisal N.; Samatova, Nagiza F.; Rizk, Mohamad A.; Langston, Micheal A. (IEEE, 2017-03-20)
    In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications, MCS is a familiar and challenging problem. ...
  • A new approach and faster exact methods for the maximum common subgraph problem 
    Abu-Khzam, Faisal N.; Suters, W. Henry; Zhang, Yun; Synibs, Christopher T.; Samatova, Nagiza F.; Langston, Micheal A. (Springer, 2017-03-21)
    The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectively, and find the largest induced subgraph ...
  • On the relative efficiency of maximal clique enumeration algorithms, with application to high-throughput computational biology 
    Abu-Khzam, Faisal N.; Baldwin, Nicole E.; Langston, Micheal A.; Samatova, Nagiza F. (2018-04-24)
    The efficient enumeration of maximal cliques has applications in microarray analysis and a number of other foundational problems of computational biology. In this paper, we analyze and test existing maximal clique enumeration ...

Search LAUR


Advanced Search

Browse

My Account