MARC details
000 -LEADER |
fixed length control field |
02303nam a22003498i 4500 |
001 - CONTROL NUMBER |
control field |
CR9780511721649 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
UkCbUP |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20170526205631.0 |
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS--GENERAL INFORMATION |
fixed length control field |
m|||||o||d|||||||| |
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
fixed length control field |
cr|||||||||||| |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
100303s2008||||enk o ||1 0|eng|d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9780511721649 (ebook) |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
Cancelled/invalid ISBN |
9780521878647 (hardback) |
040 ## - CATALOGING SOURCE |
Original cataloging agency |
UkCbUP |
Language of cataloging |
eng |
Description conventions |
rda |
Transcribing agency |
UkCbUP |
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER |
Classification number |
511.5 |
Edition number |
22 |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Nagamochi, Hiroshi, |
Relator term |
author. |
245 10 - TITLE STATEMENT |
Title |
Algorithmic Aspects of Graph Connectivity / |
Statement of responsibility, etc |
Hiroshi Nagamochi, Toshihide Ibaraki. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
1 online resource (392 pages) : |
Other physical details |
digital, PDF file(s). |
490 0# - SERIES STATEMENT |
Series statement |
Encyclopedia of Mathematics and its Applications ; |
Volume number/sequential designation |
123 |
500 ## - GENERAL NOTE |
General note |
Title from publisher's bibliographic system (viewed on 28 Feb 2017). |
520 ## - SUMMARY, ETC. |
Summary, etc |
Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and production, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors thoroughly discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Graph connectivity |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Graph algorithms |
700 1# - ADDED ENTRY--PERSONAL NAME |
Personal name |
Ibaraki, Toshihide, |
Relator term |
author. |
776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
Display text |
Print version: |
International Standard Book Number |
9780521878647 |
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE |
Uniform title |
Encyclopedia of Mathematics and its Applications ; |
Volume number/sequential designation |
123. |
856 40 - ELECTRONIC LOCATION AND ACCESS |
Uniform Resource Identifier |
<a href="https://doi.org/10.1017/CBO9780511721649">https://doi.org/10.1017/CBO9780511721649</a> |
952 ## - LOCATION AND ITEM INFORMATION (KOHA) |
Koha itemnumber |
162683 |
264 #1 - |
-- |
Cambridge : |
-- |
Cambridge University Press, |
-- |
2008. |
336 ## - |
-- |
text |
-- |
txt |
-- |
rdacontent |
337 ## - |
-- |
computer |
-- |
c |
-- |
rdamedia |
338 ## - |
-- |
online resource |
-- |
cr |
-- |
rdacarrier |