MARC details
000 -LEADER |
fixed length control field |
01703cam a2200349 i 4500 |
001 - CONTROL NUMBER |
control field |
17487048 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
OSt |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20250313153532.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
121009t20132013gw a b 001 0 eng |
010 ## - LIBRARY OF CONGRESS CONTROL NUMBER |
LC control number |
2012951158 |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9783642436642 (Pbk) |
040 ## - CATALOGING SOURCE |
Original cataloging agency |
DLC |
Language of cataloging |
eng |
Description conventions |
rda |
Transcribing agency |
IISERB |
041 1# - LANGUAGE CODE |
Language code of text/sound track or separate title |
eng |
Language code of original and/or intermediate translations of text |
ger |
050 00 - LIBRARY OF CONGRESS CALL NUMBER |
Classification number |
QA402.5 |
Item number |
.J8913 2013 |
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
Edition number |
23 |
Classification number |
511.5 J95G4 |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Jungnickel, Dieter. |
9 (RLIN) |
31765 |
240 10 - UNIFORM TITLE |
Uniform title |
<a href="Graphen, Netzwerke und Algorithmen.">Graphen, Netzwerke und Algorithmen.</a> |
Language of a work |
English |
245 10 - TITLE STATEMENT |
Title |
Graphs, networks, and algorithms / |
Statement of responsibility, etc |
Dieter Jungnickel. |
250 ## - EDITION STATEMENT |
Edition statement |
Fourth edition. |
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
Place of publication, distribution, etc |
New York: |
Name of publisher, distributor, etc |
Springer-Verlag, |
Date of publication, distribution, etc |
2013. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
xx, 675 pages : |
Other physical details |
illustrations ; |
Dimensions |
24 cm. |
490 0# - SERIES STATEMENT |
Series statement |
Algorithms and computation in mathematics, |
International Standard Serial Number |
1431-1550 ; |
Volume number/sequential designation |
5 |
500 ## - GENERAL NOTE |
General note |
Earlier editions published in 1998, 2004, and 2008. |
504 ## - BIBLIOGRAPHY, ETC. NOTE |
Bibliography, etc |
Includes bibliographical references (pages 629-659) and index. |
505 0# - FORMATTED CONTENTS NOTE |
Formatted contents note |
1. Basic graph theory -- 2. Algorithms and complexity -- 3. Shortest paths -- 4. Spanning trees -- 5. The greedy algorithm -- 6. Flows -- 7. Combinatorial applications -- 8. Connectivity and depth first search -- 9. Colorings -- 10. Circulations -- 11. The network simplex algorithm -- 12. Synthesis of networks -- 13. Matchings -- 14. Weighted matchings -- 15. A hard problem: the TSP -- Appendix A. Some NP-complete problems -- Appendix B. Solutions -- Appendix C. List of symbols. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Combinatorial optimization. |
9 (RLIN) |
31766 |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Graph theory. |
9 (RLIN) |
31767 |
906 ## - LOCAL DATA ELEMENT F, LDF (RLIN) |
a |
7 |
b |
cbc |
c |
origcop |
d |
2 |
e |
ncip |
f |
20 |
g |
y-gencatlg |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
Dewey Decimal Classification |
Koha item type |
Books |