Normal view MARC view ISBD view

Algorithms for coloring random and semi-random graphs by C. R. Subramanian

By:

Contributor(s):

Material type: Book

BookPublication details: Bangalore : Indian Institute of Science, 1994.Description: vi, 148 pDissertation: PhD;1994;Computer Science and AutomationDDC classification:

Dissertation note: PhD;1994;Computer Science and Automation

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

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
Thesis	JRD Tata Memorial Library	511.50285 N94 (Browse shelf(Opens below))	Available		T03686

Previous		No cover image available		No cover image available	No cover image available			Next
Previous	511.5 TER Zeta functions of graphs : a stroll through the garden	511.5011 N99 Algorithms and lower bounds for graph connectivity and covering	511.501512 CVE Introduction to the theory of graph spectra	511.50285 N94 Algorithms for coloring random and semi-random graphs	511.50285 P12 Parameterized complexity of maximum edge coloring in graphs	511.50285 REI Digital geometry Geometric methods for digital picture analysis	511.502853 KNU Stanford graphbase by Donald E. Knuth	Next

Includes references

PhD;1994;Computer Science and Automation

There are no comments on this title.

to post a comment.