cover image

Algorithmic graph theory and perfect graphs / Martin Charles Golumbic.

New York : Academic Press, 1980.
ISBN 9780122892608, 0122892607

Location Call Number Status Consortium Loan
George Washington
Gelman stacks
QA166 .G64 2004 (show me on map) Available Request
WRLC Shared Collections Facility
QA 166 .G64 (show me on map) Off-site
WRLC Shared Collections Facility
QA 166 .G64 (show me on map) Off-site
LIB stacks
QA166 .G64 Available Request
UNIV Electronic Book
Electronic Book
George Mason
Fenwick stacks
QA166 .G64 Available Request
Off-Campus Shelving
QA166 .G64 Available Request
Founders Library stacks
QA166 G64 Available Request
Subjects Grafentheorie.
Graphes parfaits.
Graphes, Théorie des.
Perfect graphs.
graphe permutation.
theorie graphe.
Series Computer science and applied mathematics.
Description xx, 284 pages : illustrations ; 24 cm.
Copyright Date 1980.
Notes Includes bibliographical references and index.
Contents Graph theoretic foundations -- The design of efficient algorithms -- Perfect graphs -- Triangulated graphs -- Comparability graphs -- Split graphs -- Permutation graphs -- Interval graphs -- Superperfect graphs -- Threshold graphs -- Not so perfect graphs -- Perfect Gaussian elimination -- Appendix. A.A small collection of NP-complete problems -- B. An algorithm for set union, intersection, difference, and symmetric difference of two subsets -- C. Topological sorting: an example of algorithm 2.4 -- D. An illustration of the decomposition algorithm -- E. The properties P.E.B., C.B., (P.E.B.)', (C.B.)' illustrated -- F. The properties C, C̄, T, T̄ illustrated.
Network Numbers (OCoLC)5564855
WorldCat Search OCLC WorldCat
WorldCat Identities Golumbic, Martin Charles.
Publication timeline, list of works, related names and subjects and other information


Export citation to: RefWorks