000 00939nam a2200289 a 4500
008 141027s1976 cau i000 0 eng d
020 _cHadiah
040 _aUKM
_erda
090 _aRAND 7
_bP-5574 1976
100 1 _aBedrosian, Edward.,
_eauthor
245 1 2 _aA routing algorithm for digraphs /
_cEdward Bedrosian
300 _a4 pages ;
_c28 cm.
336 _atext
_2rdacontent
337 _aunmediated
_2rdamedia
338 _avolume
_2rdacarrier
490 1 _aThe Rand paper series ;
_vP-5574
504 _aIncludes bibliographical references (page 4)
650 0 _aGraph theory.
650 0 _aAlgorithms.
710 2 _aResearch and Development Corporation,
_eissuing body.
830 0 _aRand paper series ;
_vP-5574
907 _a.b1691059x
_b2022-03-11
_c2022-03-11
942 _c4
_n0
_kRAND 7 P-5574 1976
990 _azear
991 _aKoleksi Dokumen
998 _at
_b2022-03-11
_cm
_da
_feng
_gcau
_y0
_z.b1691059x
999 _c658185
_d658185