A high-performance toolkit for fast exact algorithms
Ongoing work is described in which fast graph algorithms are combined with parallel, grid and reconfigurable technologies. This synergistic strategy can help solve problem instances too large or too difficult for standard techniques. Target problems need only be amenable to reduction and decompositi...
محفوظ في:
| المؤلف الرئيسي: | Abu-Khzam, Faisal N. (author) |
|---|---|
| مؤلفون آخرون: | Langston, Micheal A. (author), Shanbhag, Pushkar (author) |
| التنسيق: | conferenceObject |
| منشور في: |
2017
|
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/5412 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.12.3609&rep=rep1&type=pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
A hybrid graph representation for exact graph algorithms
حسب: Abu-Khzam, Faisal N.
منشور في: (2014) -
An exact algorithm for connected red–blue dominating set
حسب: Abu-Khzam, Faisal N.
منشور في: (2011) -
A fast exact sequential algorithm for the partial digest problem
حسب: Mostafa M. Abbas (17058093)
منشور في: (2016) -
A new approach and faster exact methods for the maximum common subgraph problem
حسب: Abu-Khzam, Faisal N.
منشور في: (2017) -
Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs
حسب: Abu-Khzam, Faisal N.
منشور في: (2017)