-
1
A hybrid graph representation for exact graph algorithms
Published 2014“…We investigate practical implementation-based aspects of exact graph algorithms by providing a simple hybrid graph representation that trades space for time to address the said take-back challenge. …”
Get full text
Get full text
Get full text
conferenceObject -
2
A hybrid graph representation for recursive backtracking algorithms
Published 2017“…In this paper, we investigate practical implementation-based aspects of exact algorithms by providing a hybrid graph representation that addresses the take-back challenge and combines the advantage of O(1)O(1) adjacency-queries in adjacency-matrices with the advantage of efficient neighborhood traversal in adjacency-lists.…”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
3
-
4
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 -
5
A fault-tolerant approach for the shortest path algorithm in large spectrum graphs. (c2007)
Published 2007Get full text
Get full text
masterThesis -
6
Heuristics for graph decomposition
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 -
7
-
8
GENETIC SCHEDULING OF TASK GRAPHS
Published 2020“…A genetic algorithm for scheduling computational task graphs is presented. …”
Get full text
article -
9
On the disk dimension of planar graphs
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 -
10
A parallel search tree algorithm for vertex cover on graphical processing units. (c2013)
Published 2013Get full text
Get full text
masterThesis -
11
An Effective Hash Based Assessment and Recovery Algorithm for Healthcare Systems
Published 2019“…Within the scope of the damage assessment and recovery, several matrix based, cluster based, and graph based models were introduced. …”
Get full text
Get full text
Get full text
masterThesis -
12
A linear programming approach for the weighted graph matchingproblem
Published 1993“…The complexity of the proposed algorithm is polynomial time, and it is O(n 6L) for matching graphs of size n. …”
Get full text
Get full text
article -
13
A LINEAR-PROGRAMMING APPROACH FOR THE WEIGHTED GRAPH MATCHING PROBLEM
Published 2020“…The complexity of the proposed algorithm is polynomial time, and it is O(n6 L) for matching graphs of size n. …”
Get full text
article -
14
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 -
15
-
16
Enhancing fairness and scalability in IOTA tangle networks: a POMDP-based tip selection algorithm for decentralized systems
Published 2025“…This study presents a novel Partially Observable Markov Decision Process (POMDP)-based Tip Selection Algorithm (TSA) to optimize fairness in the IOTA Tangle. …”
-
17
-
18
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 -
19
-
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
