Parallel Implementation Of Bellman-Ford Algorithm For All-Pair Shortest Paths Problem (Record no. 287915)

MARC details
000 -LEADER
fixed length control field 00688nam a2200193Ia 4500
001 - CONTROL NUMBER
control field 0000229600
003 - CONTROL NUMBER IDENTIFIER
control field 0004
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 181108s2007||||xx#|||||||||||||| ||eng||
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number THESIS
084 ## - OTHER CLASSIFICATION NUMBER
Classification number THESIS
Item number KAL
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Kalsoom, Tahira
245 10 - TITLE STATEMENT
Title Parallel Implementation Of Bellman-Ford Algorithm For All-Pair Shortest Paths Problem
Medium [Book].
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Wah cantt
Name of publisher, distributor, etc. CUI WAH CS Dept
Date of publication, distribution, etc. 2007
365 ## - TRADE PRICE
Price type code 01
Price amount 0.00
521 ## - TARGET AUDIENCE NOTE
Target audience note All.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Parallel Implementation Of Bellman-Ford Algorithm For All-Pair Shortest Paths Problem
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Kalsoom Tahira FA14-R03-023/WAH
852 ## - LOCATION
Accession No. 10004000010989
-- 550.00
Former shelving location Books
Holdings
Withdrawn status Lost status Damaged status Not for loan Home library Current library Shelving location Date acquired Total checkouts Full call number Barcode Date last seen Price effective from Koha item type
        COMSATS University Wah Campus COMSATS University Wah Campus   09/28/2023   MCS 2007 10004000010989 09/28/2023 09/28/2023 Books