Font Size:
a
A
A
Keyword [NP-complete]
Result: 1 - 20 | Page: 1 of 3
1.
Hypergraph Embedding Problems In Networks
2.
Connectivity, Strong Orientation Of Graphs And Wireless Sensor Networks
3.
Study On Paired-Domination Problem In Graphs With Mechanization
4.
Algorithms And Complexity Of Conditional Coloring
5.
Scheduling A Batching Machine And On-line Scheduling On Parallel Machines
6.
Theory And Algorithm For The Problem Of Curriculum Schedule Arranging
7.
Research And Application Of DNA Computing Model Based On Plasmids
8.
Mining The Course Scheduling Data With Markov Chain
9.
Cover The Vertices Of A Graph By Induced Matchings
10.
A Study Of The Algorithm And Computational Complexity For A Type Of TMF Scheduling Problem
11.
Research On Some Problems Of Bin Coloring
12.
DNA Algorithm Of Hamilton Graphs With Applications
13.
Algorithm And Complexity For Domination
14.
Several Types Of DNA Algorithms For NP-complete Problems
15.
Research And Implementation Of Algorithm For Minimum Breakpoint Median From PQ-trees
16.
The Range Constrained NP-complete Problem And Design Of Approximation Algorithms
17.
Batch Scheduling Problem
18.
Division Of Small-diameter Diagram And Coverage Issues,
19.
The Computational Model Of Living Organisms In The Np-complete Problem
20.
On The Bondage Numbers Of Graphs
<<First
<Prev
Next>
Last>>
Jump to
