Search alternatives:
cc3d algorithm » rd algorithm (Expand Search)
Showing 1 - 20 results of 124 for search 'graph ((cc3d algorithm) OR (_ algorithms))', query time: 0.07s Refine Results
  1. 1
    Topics in graph algorithms

    Topics in graph algorithms by Abu-Khzam, Faisal Nabih

    Published 2003
    “…We present a linear time algorithm to approximate the pathwidth of planar graphs that have a fixed disk dimension. …”
    Get full text
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  2. 2
    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:
  3. 3
    A hybrid graph representation for recursive backtracking algorithms

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

    Published 2017
    “…Many exact algorithms for NPNP -hard graph problems adopt the old Davis-Putman branch-and-reduce paradigm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  4. 4
    Graph Computing Systems and Partitioning Techniques: A Survey

    Graph Computing Systems and Partitioning Techniques: A Survey by Tewodros Alemu Ayall (19273717)

    Published 2022
    Subjects:
    Save to List
    Saved in:
  5. 5
    Linear-time algorithms for problems on planar graphs with fixed disk dimension

    Linear-time algorithms for problems on planar graphs with fixed disk dimension by Abu-Khzam, Faisal N.

    Published 2007
    “…Useful properties of graphs with a given disk dimension are derived, leading to an algorithm to obtain an outerplanar subgraph of a graph with disk dimension k by removing at most 2k−2 vertices. …”
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  6. 6
    Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs

    Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs by Abu-Khzam, Faisal N.

    Published 2006
    Get full text
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  7. 7
    A dynamically turbo-charged heuristic for graph coloring. (c2018)

    A dynamically turbo-charged heuristic for graph coloring. (c2018) by Chahine, Bachir

    Published 2018
    Subjects: Get full text
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  8. 8
    A Graph Heuristic Approach for the Data Path Allocation Problem

    A Graph Heuristic Approach for the Data Path Allocation Problem by Makhoul, Racha

    Published 2022
    Get full text
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  9. 9
    Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem

    Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem by Haraty, Ramzi A.

    Published 2018
    “…In this paper, we analyse the Genetic Algorithm approach for graph colouring corresponding to the timetable problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:
  10. 10
    A fault-tolerant approach for the shortest path algorithm in large spectrum graphs. (c2007)

    A fault-tolerant approach for the shortest path algorithm in large spectrum graphs. (c2007) by Fares, Joseph

    Published 2007
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  11. 11
    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
    Subjects: Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  12. 12
    Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017)

    Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017) by Yassine, Mohamad M.

    Published 2017
    Subjects: Get full text
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  13. 13
    Decision trees

    Decision trees by Srour, F. Jordan

    Published 2026
    Subjects: Get full text
    Get full text
    Get full text
    bookPart
    Save to List
    Saved in:
  14. 14
    Heuristics for graph decomposition

    Heuristics for graph decomposition by Mansour, N.

    Published 2000
    “…The heuristic procedure that we propose is based on a hybrid genetic algorithm (HGA) for decomposing a graph followed by an iterative improvement heuristic for tuning the HGA's results. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  15. 15
    A Fuzzy Low-Dimensional Intersection Graph Representation Approach for Graph Compression and Anonymization

    A Fuzzy Low-Dimensional Intersection Graph Representation Approach for Graph Compression and Anonymization by Yamout, Youssef

    Published 2021
    “…We examine several heuristic algorithms in an attempt to achieve these two main objectives and conduct a thorough experimental analysis providing evidence of the effectiveness of our graph mapping approach. …”
    Get full text
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  16. 16
    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
    Subjects: “…Computer algorithms…”
    Get full text
    Get full text
    masterThesis
    Save to List
    Saved in:
  17. 17
    GENETIC SCHEDULING OF TASK GRAPHS

    GENETIC SCHEDULING OF TASK GRAPHS by Benten, M. S.

    Published 2020
    “…A genetic algorithm for scheduling computational task graphs is presented. …”
    Get full text
    article
    Save to List
    Saved in:
  18. 18
    On the disk dimension of planar graphs

    On the disk dimension of planar graphs by Abu-khzam, Faisal

    Published 2011
    “…More significantly, we devise a direct and highly practical linear-time algorithm to decide whether an arbitrary graph has fixed disk dimension k or less. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  19. 19
    Graph contraction for physical optimization methods

    Graph contraction for physical optimization methods by Mansour, Nashat

    Published 1993
    “…Then we present a mapping-oriented Parallel Graph Contraction (PGC) heuristic algorithm that yields a smaller representation of the problem to which mapping is then applied. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
    Save to List
    Saved in:
  20. 20
    Partitioning a graph into degenerate subgraphs

    Partitioning a graph into degenerate subgraphs by Abu-Khzam, Faisal N.

    Published 2018
    “…This generalizes a result of Bonamy et al. (2017) and can be viewed as an algorithmic extension of Brooks’ Theorem and several results on vertex arboricity of graphs of bounded maximum degree. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
    Save to List
    Saved in:

Search Tools: