-
1
A hybrid graph representation for exact graph algorithms
منشور في 2014"…Many exact search algorithms for NP-hard graph problems adopt the old Davis-Putman branch-and-reduce paradigm. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
2
-
3
-
4
Stochastic Search Algorithms for Exam Scheduling
منشور في 2007"…In this work, we use a modified weighted-graph coloring problem formulation and adapt two stochastic search algorithms for solving the problem. …"
احصل على النص الكامل
احصل على النص الكامل
article -
5
A bounded search tree algorithm for parameterized
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
6
A hybrid graph representation for recursive backtracking algorithms
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
7
Improved search-tree algorithms for the cluster edit problem. (c2011)
منشور في 2011احصل على النص الكامل
احصل على النص الكامل
masterThesis -
8
Maximal clique enumeration. (c2007)
منشور في 2007احصل على النص الكامل
احصل على النص الكامل
masterThesis -
9
Gesture-based Graph-theoretic Robot Formation Control
منشور في 2022احصل على النص الكامل
doctoralThesis -
10
-
11
Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs
منشور في 2017"…Parallelizing the search within these components is instrumental in improving the running times of the algorithms.…"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
12
Asymptotically faster algorithms for parameterized FACE COVER
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
13
A genetic algorithm for corrective retesting. (c1995)
منشور في 1995احصل على النص الكامل
احصل على النص الكامل
masterThesis -
14
Genetic and heuristic algorithms for regrouping service sites. (c2000)
منشور في 2000احصل على النص الكامل
احصل على النص الكامل
masterThesis -
15
Physical optimization algorithms for mapping data to distributed-memory multiprocessors
منشور في 1992"…The technique proposed for large problems is based on a pre-mapping graph contraction heuristic algorithm, which results in a smaller search space. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
16
Timing influenced general-cell genetic floorplanner
منشور في 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. …"
احصل على النص الكامل
article -
17
The maximum common subgraph problem
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
conferenceObject -
18
Virtual topologies for massively parallel computations. (c2015)
منشور في 2015"…In their essence, recursive search tree algorithms are nothing but mere enumeration of the solution space. …"
احصل على النص الكامل
احصل على النص الكامل
masterThesis -
19
An easy-to-use scalable framework for parallel recursive backtracking
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article -
20
On scalable parallel recursive backtracking
منشور في 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. …"
احصل على النص الكامل
احصل على النص الكامل
احصل على النص الكامل
article
