Normal view MARC view ISBD view

Study of Parallel Algorithms for Finding Connected Components in Graphs [M.Phil Thesis]

Material type: materialTypeLabel

BookPublisher: Pakistan University of the Punjab 2021Edition: 1st.Description: 37.DDC classification: 004.3 SHA

Tags from this library: No tags from this library for this title. Log in to add tags.

average rating: 0.0 (0 votes)

Item type	Current location	Call number	Status	Date due	Barcode
Reference	FCITOC	004.3 SHA (Browse shelf)	Not for loan		702226

Previous	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	Next
Previous	004.3 SAS Introduction to Parallel Processing	004.30 SEE Online Automobile Trading System [BSCF11M077,BSCF11M086]	004.3 SHA Optimization of Routing Protocol in Internet of Things	004.3 SHA Study of Parallel Algorithms for Finding Connected Components in Graphs [M.Phil Thesis]	004.3 SHA To Measure the Efficiency of Transcriptome Assembly by using De novo, Reference-base, and Hybrid Algorithms [M.Phil Thesis]	004.3 SHA Future Demand Analysis of Electricity in LESCO Region [M.Phil Thesis]	004.30 SHA Times of Sargodha News Potal [BSCF12M001,BSCF12M002,BSCF12M003]	Next

There are no comments for this item.

Library PU-FCIT