[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-326544-105":59,"doc-detail-326544-en":130},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","algorithms-and-computation-in-mathematics-volume-5-graphs-networks-and-algorithms-preface","Algorithms and Computation in Mathematics - Volume 5 - Graphs, Networks and Algorithms - Preface","","Algorithms and Computation in Mathematics, Volume 5, presents graphs, networks, and algorithmic foundations through the lens of combinatorial optimization. The prefaces to the first and second editions describe the book’s reprint, corrections, expanded content, and updated bibliography, including a new chapter on the network simplex algorithm and a section on the five color theorem. The text highlights rapid field development driven by both practical engineering needs and advances in efficient computer systems, and it sets an algorithmic, graph-theoretic focus using finite graphs.",{"@graph":69,"@context":122},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":40,"@type":76,"position":81},"https://docshare.wps.com/document/research-report/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/algorithms-and-computation-in-mathematics-volume-5-graphs-networks-and-algorithms-preface/326544/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/algorithms-and-computation-in-mathematics-volume-5-graphs-networks-and-algorithms-preface/326544.png","ImageObject",300,407,{"name":92,"@type":93},"Hazel","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-10-25","2026-09-21",true,{"@type":102,"interactionType":103,"userInteractionCount":44},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"What changes were made for the second edition?","Question",{"text":112,"@type":113},"The second edition was thoroughly revised with corrections, updates to the bibliography, reordered presentation (starting with Chapter 8), added material including a chapter on the network simplex algorithm, and a section on the five color theorem, plus new exercises.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"What is the main scope of the book?",{"text":117,"@type":113},"The book focuses on the part of combinatorial optimization that can be formulated and treated by graph theoretical methods, with an introduction to graph theory restricted to finite graphs, while avoiding the theory of linear programming and polyhedral combinatorics.",{"name":119,"@type":110,"acceptedAnswer":120},"Why has combinatorial optimization and graph theory developed quickly?",{"text":121,"@type":113},"The preface attributes growth to the increased use of combinatorial arguments and to practical problems from engineering and management, as well as improved access through more efficient computer systems, alongside links to complexity theory.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},326544,1790466140,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":39,"category_name":40,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":44,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":139,"language":140,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":141,"faqs":142,"seo_title":143,"seo_description":67,"update_tm":144,"read_time":145,"preview_page_count":4},137441390410,"https://ap-avatar.wpscdn.com/avatar/2000252f4ab5702993?_k=1776741390130283984","Algorithms and Computation in Mathematics • Volume 5  \nEditors  \nManuel Bronstein Arjeh M. Cohen Henri Cohen David Eisenbud Bernd Sturmfels  \nDieter Jungnickel  \nGraphs, Networksand Algorithms  \nSecond Edition  \nWith 195 Figures  \n1 3  \nDieter Jungnickel Universität Augsburg Institut für Mathematik  \nLehrstuhl für Diskrete Mathematik, Optimierung und Operations Research 86135 Augsburg, Germany [e-mail: jungnickel@math.uni-augsburg.de](e-mail: jungnickel@math.uni-augsburg.de)  \nMathematics Subject Classification (2000): 05-01, 68R10, 68Q25  \nLibrary of Congress Control Number: 2004112299  \nSecond, completely revised edition (based on the translation of the third German edition by Tilla Schade in collaboration with the author)  \nISSN 1431-1550  \nISBN 3-540-21905-6 Springer Berlin Heidelberg New York  \nISBN 3-540-63760-5 1st edition Springer-Verlag Berlin Heidelberg New York  \nThis work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilmorin any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable for prosecution under the German Copyright Law.  \nSpringer is a part of Springer Science+Business Media [springeronline.com](springeronline.com)  \n© Springer-Verlag Berlin Heidelberg 2005  \nPrinted in Germany  \nThe use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use.  \nTypesetting: by the author using a Springer LATEX macro package  \nProduction: LE-TEX Jelonek, Schmidt & Vöckler GbR, Leipzig  \nCover design: design & production GmbH, Heidelberg Printed on acid-free paper 46/3142YL-5 4 3 2 1 0  \nA mathematician, like a painter or a poet, is a maker of patterns.  \nIf his patterns are more permanent than theirs, it is because they are made with ideas.  \nG. H. Hardy  \nTo my teacher, Prof. Hanfried Lenz  \nPreface to the Second Edition  \nChange is inevitable. .. Change is constant.  \nBenjamin Disraeli  \nWhen the first printing of this book sold out in a comparatively short time, it was decided to reprint the original edition with only small modifications: I just took the opportunity to correct a handful of minor mistakes and to provide a few updates to the bibliography. In contrast, the new second edition has been thoroughly revised, even though the general aims of the book have remained the same. In particular, I have added some new material, namely a chapter on the network simplex algorithm and a section on the five color theorem; this also necessitated some changes in the previous order of the presentation (so that the numbering differs from that of the first edition, beginning with Chapter 8) . In addition to this, numerous smaller changes and corrections have been made and several recent developments have been discussed and referenced. There are also several new exercises.  \nAgain, I thank my students and assistants for their attention and interest as well as the input they provided. Moreover, I am particularly grateful to two colleagues: Prof. Chris Fisher who read the entire manuscript and whose suggestions led to many improvements in the presentation; and Priv.-Doz. Dr. Bernhard Schmidt who let me make use of his lecture notes on the network simplex algorithm.  \nAugsburg, September 2004 Dieter Jungnickel  \nPreface to the First Edition  \nThe algorithmic way of life is best. Hermann Weyl  \nDuring the last few decades, combinatorial optimization and graph theory have – as the whole field of combinatorics in general – experienced a partic","cbCais8ghcDisgg6","https://ap.wps.com/l/cbCais8ghcDisgg6","pdf",3369917,615,"English","# Preface to the Second Edition\n## Preface to the First Edition\n# Introduction and Scope","[{\"question\":\"What changes were made for the second edition?\",\"answer\":\"The second edition was thoroughly revised with corrections, updates to the bibliography, reordered presentation (starting with Chapter 8), added material including a chapter on the network simplex algorithm, and a section on the five color theorem, plus new exercises.\"},{\"question\":\"What is the main scope of the book?\",\"answer\":\"The book focuses on the part of combinatorial optimization that can be formulated and treated by graph theoretical methods, with an introduction to graph theory restricted to finite graphs, while avoiding the theory of linear programming and polyhedral combinatorics.\"},{\"question\":\"Why has combinatorial optimization and graph theory developed quickly?\",\"answer\":\"The preface attributes growth to the increased use of combinatorial arguments and to practical problems from engineering and management, as well as improved access through more efficient computer systems, alongside links to complexity theory.\"}]","Algorithms and Computation in Mathematics - Volume 5 - Graphs, Networks and Algorithms - Preface | PDF",1789974523,1550]