Font Size:
a
A
A
Keyword [NP completeness]
Result: 1 - 15 | Page: 1 of 1
1.
Design Of Survivable Networks Based On Disjoint Paths
2.
The Complexity Of Some Batching Scheduling And On-Line Scheduling Problems
3.
Two Scheduling Problems On Uniform Machines With Rejection
4.
On The Bounded Fragmentation Graphs And The Edge Bounded Fragmentation Graphs
5.
Parallel Machine Scheduling With Simultaneity Constraint
6.
Research On The Parameterized Algorithms For Cover Problems
7.
Single Machine Scheduling Problems With Resource Dependent Release Times And Penalty Factor
8.
NP-completeness and another solution problem
9.
Research On Total Edge Domination And Semitotal Edge Domination Problems For Graphs
10.
Computation Of Some Domination-related Parameters In Graphs
11.
Research On Variable Decision Algorithm Based On CDCL Learning Framework
12.
Research On Independent Roman Domination Problem Of Graphs
13.
Research On Modern Roman Domination Problem Of Graphs
14.
Research On Roman Class Domination Theory Of Graph
15.
Polynomial Decision Algorithms And Complexity For The Sorting By Symmetric Reversals Problem
<<First
<Prev Next>
Last>>
Jump to
