Search alternatives:
search » research (Expand Search)
Showing 1 - 20 results of 24 for search 'graph search algorithm', query time: 0.05s Refine Results
  1. 1
    A hybrid graph representation for exact graph algorithms

    A hybrid graph representation for exact graph algorithms by Abu-Khzam, Faisal N.

    Published 2014
    “…Many exact search algorithms for NP-hard graph problems adopt the old Davis-Putman branch-and-reduce paradigm. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  2. 2
    A decentralized load balancing strategy for parallel search-three optimization. (c2010)

    A decentralized load balancing strategy for parallel search-three optimization. (c2010) by Mouawad, Amer E.

    Published 2010
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  3. 3
    A parallel search tree algorithm for vertex cover on graphical processing units. (c2013)

    A parallel search tree algorithm for vertex cover on graphical processing units. (c2013) by Kabbara, Rashad Karim

    Published 2013
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  4. 4
    Stochastic Search Algorithms for Exam Scheduling

    Stochastic Search Algorithms for Exam Scheduling by Mansour, Nashat

    Published 2007
    “…In this work, we use a modified weighted-graph coloring problem formulation and adapt two stochastic search algorithms for solving the problem. …”
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  5. 5
    A bounded search tree algorithm for parameterized

    A bounded search tree algorithm for parameterized by Abu-Khzam, Faisal N.

    Published 2008
    “…This paper builds on previous work of the authors and employs a structure theorem of Aksionov et al., with a detailed case analysis, to produce a face cover algorithm that runs in O(k4.6056+n2) time. We also point to the tight connections with red–blue dominating set on planar graphs via the annotated version of face cover that we consider in our search tree algorithm. …”
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  6. 6
    A hybrid graph representation for recursive backtracking algorithms

    A hybrid graph representation for recursive backtracking algorithms by Abu-Khzam, Faisal N.

    Published 2017
    “…The performance of these algorithms often suffers from the increasing number of graph modifications, such as deletions, that reduce the problem instance and have to be “taken back” frequently during the search process. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  7. 7
    Improved search-tree algorithms for the cluster edit problem. (c2011)

    Improved search-tree algorithms for the cluster edit problem. (c2011) by Ghrayeb, Ali Kassem

    Published 2011
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  8. 8
    Maximal clique enumeration. (c2007)

    Maximal clique enumeration. (c2007) by Barghout, Hamed

    Published 2007
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  9. 9
    Gesture-based Graph-theoretic Robot Formation Control

    Gesture-based Graph-theoretic Robot Formation Control by Sajid, Mahroo

    Published 2022
    Get full text
    doctoralThesis
    Save to List
    Saved in:
  10. 10
    A decentralized load balancing approach for parallel search-tree optimization

    A decentralized load balancing approach for parallel search-tree optimization by Abu-Khzam, F.N.

    Published 2017
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  11. 11
    Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs

    Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs by Abu-Khzam, Faisal N.

    Published 2017
    “…Parallelizing the search within these components is instrumental in improving the running times of the algorithms.…”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  12. 12
    Asymptotically faster algorithms for parameterized FACE COVER

    Asymptotically faster algorithms for parameterized FACE COVER by Abu-Khzam, Faisal N.

    Published 2005
    “…The fastest previously-published face cover al- gorithm is achieved with the bounded search tree technique, in which branching requires O(5k + n2) time. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  13. 13
    A genetic algorithm for corrective retesting. (c1995)

    A genetic algorithm for corrective retesting. (c1995) by Fakih, Khaled A.

    Published 1995
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  14. 14
    Genetic and heuristic algorithms for regrouping service sites. (c2000)

    Genetic and heuristic algorithms for regrouping service sites. (c2000) by Tabbara, Hiba

    Published 2000
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  15. 15
    Physical optimization algorithms for mapping data to distributed-memory multiprocessors

    Physical optimization algorithms for mapping data to distributed-memory multiprocessors by Mansour, Nashat

    Published 1992
    “…The technique proposed for large problems is based on a pre-mapping graph contraction heuristic algorithm, which results in a smaller search space. …”
    Get full text
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  16. 16
    Timing influenced general-cell genetic floorplanner

    Timing influenced general-cell genetic floorplanner by Sait, Sadiq M.

    Published 2020
    “…This phase is constraint graph based. The approach combines the robustness of genetic algorithm with run time efficiency and elegance of constraint graph based method. …”
    Get full text
    article
    Save to List
    Saved in:
  17. 17
    The maximum common subgraph problem

    The maximum common subgraph problem by Abu-Khzam, Faisal N.

    Published 2017
    “…We transform an essential part of the search process into the task of enumerating maximal independent sets in only a part of only one of the input graphs. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  18. 18
    Virtual topologies for massively parallel computations. (c2015)

    Virtual topologies for massively parallel computations. (c2015) by Jahed, Karim A.

    Published 2015
    “…In their essence, recursive search tree algorithms are nothing but mere enumeration of the solution space. …”
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  19. 19
    An easy-to-use scalable framework for parallel recursive backtracking

    An easy-to-use scalable framework for parallel recursive backtracking by Abu-Khzam, Faisal N.

    Published 2013
    “…Solving NP-hard graph problems to optimality using exact algorithms is an example of an area in which there has so far been limited success in obtaining large scale parallelism. …”
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  20. 20
    On scalable parallel recursive backtracking

    On scalable parallel recursive backtracking by Abu-Khzam, Faisal N.

    Published 2015
    “…Solving NP-hard graph problems to optimality using exact algorithms is an example of an area in which there has so far been limited success in obtaining large scale parallelism. …”
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:

Search Tools: