Algorithmic graph theory / (Record no. 496)

000 -LEADER
fixed length control field 01698cam a2200265 i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20221024092523.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 201125s1994enk a|||| b||| 001 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780521288811
Qualifying information paperback
040 ## - CATALOGING SOURCE
Transcribing agency UOC
Description conventions rda
Original cataloging agency UOC
Language of cataloging eng
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 511.5
Edition number 22
Item number ALA
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Gibbons, Alan
Fuller form of name (Alan M.)
Relator term author.
Titles and words associated with a name (Alan M.)
9 (RLIN) 161
245 10 - TITLE STATEMENT
Title Algorithmic graph theory /
Statement of responsibility, etc. Alan Gibbons.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Cambridge :
Name of producer, publisher, distributor, manufacturer The press Syndicate of the university of Cambridge,
Date of production, publication, distribution, manufacture, or copyright notice [1994].
264 #4 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Date of production, publication, distribution, manufacture, or copyright notice © Cambridge university press 1985.
300 ## - PHYSICAL DESCRIPTION
Extent 259 pages :
Other physical details illustrations ;
Dimensions 20 cm.
336 ## - CONTENT TYPE
Source rdacontent
Content type term text
Content type code txt
337 ## - MEDIA TYPE
Source rdamedia
Media type term unmediated
Media type code n
338 ## - CARRIER TYPE
Source rdacarrier
Carrier type term volume
Carrier type code nc
500 ## - GENERAL NOTE
General note Includes index.
520 ## - SUMMARY, ETC.
Summary, etc. This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colorability, flows in networks, matchings, and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and their complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems, a number of efficient approximation algorithms are included with known performance bounds. Everyday use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text."
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Graph theory.
9 (RLIN) 3578
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Graph theory
General subdivision Data processing.
9 (RLIN) 3579
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Koha item type Book
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Permanent location Current location Date acquired Full call number Barcode Date last seen Price effective from Koha item type Total Checkouts
          Uofcanada Library Uofcanada Library 11/25/2020 511.5 ALA/NB 00000803 11/25/2020 11/25/2020 NB-Book  
          Uofcanada Library Uofcanada Library 11/25/2020 511.5 ALA 00000804 11/25/2020 11/25/2020 Book  
          Uofcanada Library Uofcanada Library 11/25/2020 511.5 ALA 00000805 11/25/2020 11/25/2020 Book  

Services:

Circulation (Check in – Check out)
References collection
Periodicals collection
Internet Services
On-line search using online catalog (OPAC)
Users education (How to use the library)
Query answering (Ask Librarian)
Current Awareness Services (CAS)

Follow Us:

Copyright © 2020 Universities of Canada in Egypt. All rights reserved