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

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

doi:10.1109/CLUSTER.2015.91

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

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

Research output: Contribution to conference › Abstract

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 language	English
Pages	518
Number of pages	1
DOIs	https://doi.org/10.1109/CLUSTER.2015.91
Publication status	Published - 2015
Event	IEEE International Conference on Cluster Computing, CLUSTER 2015 - Chicago, United States Duration: 8 Sep 2015 → 11 Sep 2015

Conference

Conference	IEEE International Conference on Cluster Computing, CLUSTER 2015
Country/Territory	United States
City	Chicago
Period	8/09/15 → 11/09/15

Access to Document

10.1109/CLUSTER.2015.91

Cite this

@conference{6c2077baae8042fa99f284112d814905,

title = "Highly Scalable Parallel Search-Tree Algorithms: The Virtual Topology Approach",

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.",

author = "{Abu Khzam}, Faisal and K.A. Jahed and A.E. Mouawad",

year = "2015",

doi = "10.1109/CLUSTER.2015.91",

language = "English",

pages = "518",

note = "IEEE International Conference on Cluster Computing, CLUSTER 2015 ; Conference date: 08-09-2015 Through 11-09-2015",

}

TY - CONF

T1 - Highly Scalable Parallel Search-Tree Algorithms

T2 - IEEE International Conference on Cluster Computing, CLUSTER 2015

AU - Abu Khzam, Faisal

AU - Jahed, K.A.

AU - Mouawad, A.E.

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84959262877&partnerID=8YFLogxK

U2 - 10.1109/CLUSTER.2015.91

DO - 10.1109/CLUSTER.2015.91

M3 - Abstract

SP - 518

Y2 - 8 September 2015 through 11 September 2015

ER -

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

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this