-
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 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 -
3
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 -
4
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 -
5
-
6
-
7
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 -
8
A dynamically turbo-charged heuristic for graph coloring. (c2018)
Published 2018Subjects: Get full text
Get full text
Get full text
masterThesis -
9
A fault-tolerant approach for the shortest path algorithm in large spectrum graphs. (c2007)
Published 2007Get full text
Get full text
masterThesis -
10
Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017)
Published 2017Subjects: Get full text
Get full text
Get full text
masterThesis -
11
A Graph Heuristic Approach for the Data Path Allocation Problem
Published 2022Get full text
Get full text
Get full text
masterThesis -
12
A decentralized load balancing strategy for parallel search-three optimization. (c2010)
Published 2010Subjects: Get full text
Get full text
masterThesis -
13
A parallel search tree algorithm for vertex cover on graphical processing units. (c2013)
Published 2013Subjects: “…Computer algorithms…”
Get full text
Get full text
masterThesis -
14
-
15
-
16
A new approach to record clustering for large databases. (c1997)
Published 1997Get full text
Get full text
masterThesis -
17
Stochastic Search Algorithms for Exam Scheduling
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 -
18
-
19
A bounded search tree algorithm for parameterized
Published 2008“…Hence, we get both a O(k4.6056+n2) time algorithm for solving red–blue dominating set on planar graphs and a polynomial time algorithm for producing a linear kernel for annotated face cover.…”
Get full text
Get full text
Get full text
article -
20
Natural optimization algorithms for optimal regression testing
Published 1997“…The algorithms are based on an integer programming problem formulation and the program's control-flow graph. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject