Information Technology Reference
In-Depth Information
2
1
3
1
2
3
1
1
d
,
3
,
8
e
,
4
,
4
g
,
5
,
5
h
,
5
,
5
1
1
3
1
a
,
2
,
3
4
,
5
0
,
1
0
,
1
0
,
1
1
1
2
b
,
3
,
3
3
,
0
0
,
1
0
,
1
0
,
1
G
∗
)
=
N
5
,
1
1
1
2
4
(
c
,
3
,
2
0
,
1
5
,
5
0
,
1
0
,
1
1
2
1
3
1
d
,
3
,
8
0
,
1
0
,
1
4
,
5
0
,
1
3
1
2
1
e
,
4
,
4
0
,
1
0
,
1
3
,
6
0
,
1
2
3
3
1
g
,
5
,
5
0
,
1
0
,
1
0
,
1
5
,
5
and the new graph has the form
On the other hand, if we can apply, e.g., operator
N
4
,
over
G
∗
, we obtain
3
2
1
3
1
1
7
2
3
1
1
d
,
3
,
8
e
,
4
,
4
f
,
10
,
8
g
,
5
,
5
h
,
5
,
5
1
1
3
1
1
1
a
,
2
,
3
4
,
5
2
,
4
0
,
1
0
,
1
0
,
1
1
1
2
b
,
3
,
3
3
,
0
0
,
1
0
,
1
0
,
1
0
,
1
1
1
c
,
3
,
2
0
,
1
0
,
1
0
,
1
0
,
1
0
,
1
N
4
,
G
∗
)
=
3
(
1
2
1
3
1
d
,
3
,
8
0
,
1
0
,
1
0
,
1
4
,
5
0
,
1
3
1
2
1
e
,
4
,
4
0
,
1
0
,
1
0
,
1
3
,
6
0
,
1
1
7
1
1
f
,
10
,
8
0
,
1
0
,
1
0
,
1
0
,
1
3
,
4
2
3
3
1
g
,
5
,
5
0
,
1
0
,
1
0
,
1
0
,
1
5
,
5
Search WWH ::
Custom Search