Skip navigation
Home
Research Outputs
Researchers
Organizations
Projects
Explore by
Research Outputs
Researchers
Organizations
Projects
Sign on to:
My Homepage
Receive email
updates
Edit Account details
Browsing by Subject
Scheduling problem, partially ordered sets (posets), Complete Bipartite Composite (CBC) dags, N-free posets, totally-interacted graphs, m-machine, identical processors and NP-complete problem.
???browse.nav.enter.subject???
???browse.nav.jump.subject???
0-9
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
Sort by:
submit date
issue date
In order:
Ascending
Descending
Results/Page
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Authors/Record:
All
1
5
10
15
20
25
30
35
40
45
50
Showing results 1 to 1 of 1
Refman
EndNote
Bibtex
RefWorks
Send via email
Issue Date
Title
Author(s)
25-Nov-1993
On the M- Machine Scheduling for Dags with Bounded Number of Maximal Complete Bipartite Subgraphs
E. M. El-Sherif, M. M. Kouta and B.I. Bayoumi
; Khamis, Soheir
