Highly Scalable Parallel Search-Tree Algorithms: The Virtual Topology Approach

Faisal Abu Khzam, K.A. Jahed, A.E. Mouawad

    Research output: Contribution to conferenceAbstract

    Abstract

    Summary form only given. We introduce the notion of a virtual topology and explore the use of search-tree indexing to achieve highly scalable parallel search-tree algorithms for NP-hard problems. Vertex Cover and Cluster Editing are used as case studies.
    Original languageEnglish
    Pages518
    Number of pages1
    DOIs
    Publication statusPublished - 2015
    EventIEEE International Conference on Cluster Computing, CLUSTER 2015 - Chicago, United States
    Duration: 8 Sep 201511 Sep 2015

    Conference

    ConferenceIEEE International Conference on Cluster Computing, CLUSTER 2015
    CountryUnited States
    CityChicago
    Period8/09/1511/09/15

    Fingerprint Dive into the research topics of 'Highly Scalable Parallel Search-Tree Algorithms: The Virtual Topology Approach'. Together they form a unique fingerprint.

    Cite this