"The difficulty of approximating the chromatic number for random compos" by Jeffrey W. Jenness

Doctoral Dissertations

Title

The difficulty of approximating the chromatic number for random composite graphs

Author

Jeffrey W. Jenness

Department(s)

Computer Science

Degree Name

Ph. D. in Computer Science

Publisher

University of Missouri--Rolla

Publication Date

Fall 1993

Pagination

xi, 229 pages

Rights

Document Type

Dissertation - Citation

File Type

text

Language

English

Thesis Number

T 6655

Print OCLC #

31067349

Link to Catalog Record

Full-text not available: Request this publication directly from Missouri S&T Library or contact your local library.

http://merlin.lib.umsystem.edu/record=b2549809~S5

Recommended Citation

Jenness, Jeffrey W., "The difficulty of approximating the chromatic number for random composite graphs" (1993). Doctoral Dissertations. 913.
https://scholarsmine.mst.edu/doctoral_dissertations/913

This document is currently not available here.

Share My Dissertation If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.

COinS