.

Browsing SoAS - Scholarly Publications by Author "Suters, W. Henry"

LAUR Repository

Browsing SoAS - Scholarly Publications by Author "Suters, W. Henry"

Sort by: Order: Results:

  • Crown Structures for Vertex Cover Kernelization 
    Abu-Khzam, Faisal N.; Fellos, Micheal R.; Langston, Micheal A.; Suters, W. Henry (2015-12-07)
    Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discussed. One, based on linear programming, has ...
  • Kernelization algorithms for the vertex cover problem 
    Abu-Khzam, Faisal N.; Collins, Rebecca L.; Fellows, Micheal R.; Langston, Micheal A.; Suters, W. Henry; Symons, Christopher T. (2017-03-21)
    A variety of efficient kernelization strategies for the classic vertex cover problem are developed, implemented and compared experimentally. A new technique, termed crown reduction, is introduced and analyzed. Applications ...
  • 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 ...

Search LAUR


Advanced Search

Browse

My Account