-
1
Topics in graph algorithms
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 -
2
A parallel search tree algorithm for vertex cover on graphical processing units. (c2013)
Published 2013Subjects: “…Computer algorithms…”
Get full text
Get full text
masterThesis -
3
A hybrid graph representation for exact graph algorithms
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 -
4
A hybrid graph representation for recursive backtracking algorithms
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 -
5
Sensitivity to parameters and general applicability of genetic algorithms and simulated annealing algorithms for mapping data to multicomputers. (c1994)
Published 1994Subjects: “…Algorithms…”
Get full text
Get full text
masterThesis -
6
Linear-time algorithms for problems on planar graphs with fixed disk dimension
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 -
7
-
8
-
9
Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem
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 -
10
Genetic and heuristic algorithms for regrouping service sites. (c2000)
Published 2000Subjects: “…Genetic algorithms -- Data processing…”
Get full text
Get full text
masterThesis -
11
A dynamically turbo-charged heuristic for graph coloring. (c2018)
Published 2018Subjects: Get full text
Get full text
Get full text
masterThesis -
12
A fault-tolerant approach for the shortest path algorithm in large spectrum graphs. (c2007)
Published 2007Get full text
Get full text
masterThesis -
13
Properties of Unique Degree Sequences of 3-Uniform Hypergraphs
Published 2021Subjects: Get full text
-
14
Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017)
Published 2017Subjects: Get full text
Get full text
Get full text
masterThesis -
15
A portable message passing distributed library for optimizing combinatorial problems with application to circuits testing. (c2007)
Published 2007Subjects: “…Algorithms…”
Get full text
Get full text
masterThesis -
16
A Graph Heuristic Approach for the Data Path Allocation Problem
Published 2022Get full text
Get full text
Get full text
masterThesis -
17
A decentralized load balancing strategy for parallel search-three optimization. (c2010)
Published 2010Subjects: Get full text
Get full text
masterThesis -
18
-
19
Information reconciliation through agent controlled graph model. (c2018)
Published 2018“…Our approach provides a damage assessment and recovery algorithm that is based on agents and graphs.…”
Get full text
Get full text
Get full text
masterThesis -
20