{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":23,"n_cols":5,"rows_kept":23,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[15,2,15,3],[16,2,16,3],[20,2,20,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910437865003321"]
[null,null,"Autore",null,"Jungnickel Dieter"]
[null,null,"Titolo",null,"Graphs, Networks and Algorithms / / by Dieter Jungnickel"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013"]
[null,null,"ISBN",null,"3-642-32278-6"]
[null,null,"Edizione",null,"[4th ed. 2013.]"]
[null,null,"Descrizione fisica",null,"1 online resource (676 p.)"]
[null,null,"Collana",null,"Algorithms and Computation in Mathematics, , 2512-3254"]
[null,null,"Disciplina",null,"511.5"]
[null,null,"Soggetti",null,"Discrete mathematics"]
[{"$nulls":4},"Mathematical optimization"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Discrete Mathematics"]
[{"$nulls":4},"Optimization"]
[{"$nulls":4},"Mathematics of Computing"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Prefaces -- Basic Graph Theory -- Algorithms and Complexity -- Shortest Paths -- Spanning Trees -- The Greedy Algorithm -- Flows -- Combinatorial Applications -- Connectivity and Depth First Search -- Colorings -- Circulations -- The Network Simplex Algorithm -- Synthesis of Networks -- Matchings -- Weighted Matchings -- A Hard Problem: The TSP -- Appendix A: Some NP-Complete Problems -- Appendix B: Solutions -- Appendix C: List of Symbols -- References -- Index."]
[null,null,null,"Sommario/riassunto","From the reviews of the previous editions \".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ...\" K.Engel, Mathematical Reviews 2002 The substantial development effort of this text, involving multiple editions and trailing in the context of various workshops, university courses and seminar series, clearly shows through in this new edition with its clear writing, good "]
[{"$nulls":4},"organisation, comprehensive coverage of essential theory, and well-chosen applications. The proofs of important results and the representation of key algorithms in a Pascal-like notation allow this book to be used in a high-level undergraduate or low-level graduate course on graph theory, combinatorial optimization or computer science algorithms. The well-worked solutions to exercises are a real bonus for self study by students. The book is highly recommended. P .B. Gibbons, Zentralblatt für Mathematik 2005 Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-completeness (especially on dominating sets), a section on the Gallai-Edmonds structure theory for matchings, and about a dozen additional exercises – as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof forthe more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added."]