%PDF-1.6
%
102 0 obj
<>
endobj
209 0 obj
<>stream
2017-06-20T08:27:50+05:30
TeX
2017-06-21T11:26:35-07:00
2017-06-21T11:26:35-07:00
This is MiKTeX-pdfTeX 2.9.4487 (1.40.12)
MiKTeX pdfTeX-1.40.12
False
application/pdf
SHORTEST PATH PROBLEM BY MINIMAL SPANNING TREE ALGORITHM USING BIPOLAR NEUTROSOPHIC NUMBERS
M. Mullai, S. Broumi, A. Stephen
uuid:258bd668-16f4-4a3b-a246-fab15da2dc5c
uuid:869fa67c-06cd-4668-845e-0dd67ca6160a
endstream
endobj
105 0 obj
<>/Encoding<>>>>>
endobj
101 0 obj
<>
endobj
13 0 obj
<>
endobj
46 0 obj
<>
endobj
44 0 obj
<>
endobj
48 0 obj
<>
endobj
51 0 obj
<>
endobj
167 0 obj
[166 0 R 203 0 R]
endobj
52 0 obj
<>stream
xڅWr8+Ts, 7 7'3Nb+r25YK!AH:|4 %ٔ" ^/zscT)ϒY %v=N|I|䟾ZkKAbtCBYfsdE2N4Exr[Nl#r1rciDRW68^/6mWPb5ur!#gƨGnl,IMo|-س)F^W
՞\0RsF(ul8=
ꕛniQG,8&(lqRכ6
R{؇$rA)ۗ
߯(ʯ
>ˮhJpD"sR;.A xs?+PmQ0Q?~02 q3CH0Ŀ$|j6xSfTДHrikL 1Pv\ c\ՋKV(El
EAYZٕ۱= G5l^R0m"`Q69$,YV>@;:f GS,RJwa|λUix^Yg&Toh%}!S
JGr(G ysK\Ru-DiQ @ga6
"}$gf>#< zg8:1S8\p1d#&9: БGщ\&.\OV} {L Czbcetyq}JmZ).fS\W
!~?Fe1}!r3bV꣣b*g;Ą\v=GB'tcp\̏'Kqv*tbZ^ϡ]J, "{B.m(%d}y017/'y<ƥXybUH/NPvopeoU2@Jɳݿ(.U>ָ) ]n,%U]5 $,z5E6jOo[vOHN]*
KZo&?B)+ZlWV#C'«a+>l=1l ;G89{F$صvnTY
ME?^.)o_aWo
endstream
endobj
50 0 obj
<>/ProcSet[/PDF/Text]>>
endobj
5 0 obj
<>
endobj
8 0 obj
<>
endobj
100 0 obj
<>
endobj
64 0 obj
[550 575 862.5 875 300 325 500 500 500 500 500 814.8 450 525 700 700 500 863.4 963.4 750 250 300 500 800 755.2 800 750 300 400 400 500 750 300 350 300 500 500 500 500 500 500 500 500 500 500 500 300 300 300 750 500 500 750 726.9 688.4 700 738.4 663.4 638.4 756.7 726.9 376.9 513.4 751.9 613.4 876.9 726.9 750 663.4 750 713.4 550 700 726.9 726.9 976.9 726.9 726.9 600 300 500 300 500 300 300 500 450 450 500 450 300 450 500 300 300 450 250 800 550 500 500 450 412.5 400 325 525 450 650 450 475 400]
endobj
99 0 obj
<>stream
xڌP҆,!,8 NpGUUyggAFB'd`l&`JD
Sbb02322ÐZښCnb`g3#Og=@`bffd032r' jne
H;؛88z9[YX~G !;3g+#{gE#[tuuf`7swpৢxXZ\̜LIٙ[=@_sW#g3s3:@EJhf`}8 &zY`nekPwtٛhd3ą F
Յ/