Font Size:
a
A
A
Keyword [NP complete]
Result: 21 - 40 | Page: 2 of 3
21.
Some Topics On Rainbow (Vertex-) Connection Numbers Of Graphs
22.
Power Domination Problem In Graphs
23.
Research In DNA Assembly Model For Maximum Clique Problem
24.
Study Of Methods For Searching The Tetrahedral Lattice Spin States
25.
Solving Graph Coloring Problem Based On Independent Set
26.
Several NP-complete Problem Solving Algorithm Research
27.
Some Topies On Generalized Connectivity Of Graphs
28.
On The Rainbow Connections For Planar And Line Graphs
29.
The Degree-constrained Minimum K-tree Problem
30.
Research On Two-dimensional Irregular Strip Packing Problem
31.
Roman {K}-domination In Trees And Complexity Results For Some Classes Of Graphs
32.
Application Of DNA Computing Model In NP-Complete Problem
33.
Dynamic Programming Algorithm Based On Optimal Insertion Subset For The Travelling Salesman Problem
34.
NP-completeness and another solution problem
35.
Exploring Approximation Algorithms and Their Empirical Analysis For Selected NP-Complete Problems
36.
k-Pairwise disjoint shortest paths: Algorithms and complexity
37.
Scheduling with batch objectives
38.
Computational complexity of graph compactio
39.
The Rainbow Vertex-disconnection Colorings Of Graphs
40.
Application Of DNA Computing In NP Complete Problem
<<First
<Prev
Next>
Last>>
Jump to
