Algorithmic graph theory and perfect graphs /

Saved in:
Bibliographic Details
Author / Creator:Golumbic, Martin Charles.
Edition:2nd ed.
Imprint:Amsterdam : New York : Elsevier, 2004.
Description:xxvi, 314 p. : ill. ; 25 cm.
Language:English
Series:Annals of discrete mathematics ; 57
Subject:
Format: Print Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/5135889
Hidden Bibliographic Details
ISBN:0444515305
Notes:Previous ed.: New York: Academic, 1980.

MARC

LEADER 00000cam a2200000 a 4500
001 5135889
003 ICU
005 20050112150300.0
008 031218s2004 ne 000 0 eng
020 |a 0444515305 
040 |a ICU  |c ICU  |d OCoLC  |d OrLoB-B 
049 |a CGUA 
100 1 |a Golumbic, Martin Charles.  |0 http://id.loc.gov/authorities/names/n79123357  |1 http://viaf.org/viaf/2533313 
245 1 0 |a Algorithmic graph theory and perfect graphs /  |c Martin Charles Golumbic. 
250 |a 2nd ed. 
260 |a Amsterdam :  |a New York :  |b Elsevier,  |c 2004. 
300 |a xxvi, 314 p. :  |b ill. ; 25 cm. 
336 |a text  |b txt  |2 rdacontent  |0 http://id.loc.gov/vocabulary/contentTypes/txt 
337 |a unmediated  |b n  |2 rdamedia  |0 http://id.loc.gov/vocabulary/mediaTypes/n 
338 |a volume  |b nc  |2 rdacarrier  |0 http://id.loc.gov/vocabulary/carriers/nc 
440 0 |a Annals of discrete mathematics ;  |v 57 
500 |a Previous ed.: New York: Academic, 1980. 
505 0 0 |g Ch. 1.  |t Graph Theoretic Foundations --  |g Ch. 2.  |t The Design of Efficient Algorithms --  |g Ch. 3.  |t Perfect Graphs --  |g Ch. 4.  |t Triangulated Graphs --  |g Ch. 5.  |t Comparability Graphs --  |g Ch. 6.  |t Split Graphs --  |g Ch. 7.  |t Permutation Graphs --  |g Ch. 8.  |t Interval Graphs --  |g Ch. 9.  |t Superperfect Graphs --  |g Ch. 10.  |t Threshold Graphs --  |g Ch. 11.  |t Not So Perfect Graphs --  |g Ch. 12.  |t Perfect Gaussian Elimination --  |g App. A.  |t A Small Collection of NP-Complete Problems --  |g App. B.  |t An Algorithm for Set Union, Intersection, Difference, and Symmetric Difference of Two Subsets --  |g App. C.  |t Topological Sorting: An Example of Algorithm 2.4 --  |g App. D.  |t An Illustration of the Decomposition Algorithm --  |g App. E.  |t The Properties P.E.B., C.B., (P.E.B.)', (C.B.)' Illustrated --  |g App. F.  |t The Properties C, C, T, T Illustrated. 
650 0 |a Perfect graphs.  |0 http://id.loc.gov/authorities/subjects/sh85099790 
650 7 |a Perfect graphs.  |2 fast  |0 http://id.worldcat.org/fast/fst01057796 
901 |a ToCBNA 
903 |a HeVa 
035 |a (OCoLC)187707304 
929 |a cat 
999 f f |i c2bf3bdf-d5f5-5e59-9d51-4b86480d1930  |s f3cec0cc-f3c6-54d1-b98a-98da36e37afd 
928 |t Library of Congress classification  |a QA166.G64 2004  |l Eck  |c Eck-Eck  |i 4807094 
927 |t Library of Congress classification  |a QA166.G64 2004  |l Eck  |c Eck-Eck  |b 65503777  |i 7669298