{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"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":44,"n_cols":5,"rows_kept":44,"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],[8,2,8,3],[9,2,9,3],[13,2,13,3],[13,4,13,5],[14,2,14,3],[14,4,14,5],[15,2,15,3],[15,4,15,5],[16,2,16,3],[17,2,17,3],[26,2,26,3],[27,2,27,3],[28,2,28,3],[29,2,29,3],[30,2,30,3],[31,2,31,3],[32,2,32,3],[36,2,36,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996387326303316"]
[null,null,"Autore",null,"Bedloe William <1650-1680.>"]
[null,null,"Titolo",null,"An impartial account of the several fires in London, Westminster, Southwark, and the places adjacent [[electronic resource] ] : Begun and carried on by papists, for the promoting their damnable plot and conspiracy for subverting the government, and destroying the Protestant religion; with the several ways and methods practiced by them in manageing their horrid designs of fire and desolation. / / Discovered by Cap. William Bedlow who was formerly engaged with them in those wicked practices"]
[null,null,"Pubbl/distr/stampa",null,"London, : Printed for Robert Godfrey, 1679"]
[null,null,"Descrizione fisica",null,"8 p"]
[null,null,"Soggetti",null,"Popish plot, 1678"]
[{"$nulls":4},"Anti-catholicism - England"]
[{"$nulls":4},"London (England) History 17th century"]
[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","Reproduction of original in: University of London Library."]
[null,null,null,"Sommario/riassunto","eebo-0169"]
[null,"2.","Record Nr.",null,"UNINA9910139510003321"]
[null,null,"Autore",null,"Fournier Jean-Claude"]
[null,null,"Titolo",null,"Graph theory and applications with exercises and problems / / Jean-Claude Fournier"]
[null,null,"Pubbl/distr/stampa",null,"London ; ; ISTE ; ; Hoboken, NJ, : Wiley, 2009"]
[null,null,"ISBN",null,"9786613814555"]
[{"$nulls":4},"9781118623091"]
[{"$nulls":4},"1118623096"]
[{"$nulls":4},"9781282253902"]
[{"$nulls":4},"1282253905"]
[{"$nulls":4},"9780470611548"]
[{"$nulls":4},"0470611545"]
[{"$nulls":4},"9780470394205"]
[{"$nulls":4},"047039420X"]
[null,null,"Descrizione fisica",null,"1 online resource (284 p.)"]
[null,null,"Collana",null,"ISTE ; ; v.72"]
[null,null,"Classificazione",null,"SK 890"]
[null,null,"Disciplina",null,"511/.5"]
[null,null,"Soggetti",null,"Graph theory"]
[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,"Graph Theory and Applications with Exercises and Problems; Table of Contents; Introduction; Chapter 1. Basic Concepts; 1.1 The origin of the graph concept; 1.2 Definition of graphs; 1.2.1 Notation; 1.2.2 Representation; 1.2.3 Terminology; 1.2.4 Isomorphism and unlabeled graphs; 1.2.5 Planar graphs; 1.2.6 Complete graphs; 1.3 Subgraphs; 1.3.1 Customary notation; 1.4 Paths and cycles; 1.4.1 Paths; 1.4.2 Cycles; 1.4.3 Paths and cycles as graphs; 1.5 Degrees; 1.5.1 Regular graphs; 1.6 Connectedness; 1.7 Bipartite graphs; 1.7.1 Characterization; 1.8 Algorithmic aspects"]
[{"$nulls":4},"1.8.1 Representations of graphs inside amachine1.8.2 Weighted graphs; 1.9 Exercises; Chapter 2. Trees; 2.1 Definitions and properties; 2.1.1 First properties of trees; 2.1.2 Forests; 2.1.3 Bridges; 2.1.4 Tree characterizations; 2.2 Spanning trees; 2.2.1 An interesting illustration of trees; 2.2.2 Spanning trees in a weighted graph; 2.3 Application: minimum spanning tree problem; 2.3.1 The problem; 2.3.2 Kruskal's algorithm; 2.3.3 Justification; 2.3.4 Implementation; 2.3.5 Complexity; 2.4 Connectivity; 2.4.1 Block decomposition; 2.4.2 k-connectivity; "]
[{"$nulls":4},"2.4.3 k-connected graphs"]
[{"$nulls":4},"2.4.4 Menger's theorem2.4.5 Edge connectivity; 2.4.6 k-edge-connected graphs; 2.4.7 Application to networks; 2.4.8 Hypercube; 2.5 Exercises; Chapter 3. Colorings; 3.1 Coloring problems; 3.2 Edge coloring; 3.2.1 Basic results; 3.3 Algorithmic aspects; 3.4 The timetabling problem; 3.4.1 Roomconstraints; 3.4.2 An example; 3.4.3 Conclusion; 3.5 Exercises; Chapter 4. Directed Graphs; 4.1 Definitions and basic concepts; 4.1.1 Notation; 4.1.2 Terminology; 4.1.3 Representation; 4.1.4 Underlying graph; 4.1.5 \"Directed\" concepts; 4.1.6 Indegrees and outdegrees; 4.1.7 Strongly connected components"]
[{"$nulls":4},"4.1.8 Representations of digraphs inside a machine4.2 Acyclic digraphs; 4.2.1 Acyclic numbering; 4.2.2 Characterization; 4.2.3 Practical aspects; 4.3 Arborescences; 4.3.1 Drawings; 4.3.2 Terminology; 4.3.3 Characterization of arborescences; 4.3.4 Subarborescences; 4.3.5 Ordered arborescences; 4.3.6 Directed forests; 4.4 Exercises; Chapter 5. Search Algorithms; 5.1 Depth-first search of an arborescence; 5.1.1 Iterative form; 5.1.2 Visits to the vertices; 5.1.3 Justification; 5.1.4 Complexity; 5.2 Optimization of a sequence of decisions; 5.2.1 The eight queens problem"]
[{"$nulls":4},"5.2.2 Application to game theory:finding a winning strategy5.2.3 Associated arborescence; 5.2.4 Example; 5.2.5 The minimax algorithm; 5.2.6 Implementation; 5.2.7 In concrete terms; 5.2.8 Pruning; 5.3 Depth-first search of a digraph; 5.3.1 Comments; 5.3.2 Justification; 5.3.3 Complexity; 5.3.4 Extended depth-first search; 5.3.5 Justification; 5.3.6 Complexity; 5.3.7 Application to acyclic numbering; 5.3.8 Acyclic numbering algorithms; 5.3.9 Practical implementation; 5.4 Exercises; Chapter 6. Optimal Paths; 6.1 Distances and shortest paths problems; 6.1.1 A few definitions"]
[{"$nulls":4},"6.1.2 Types of problems"]
[null,null,null,"Sommario/riassunto","This book provides a pedagogical and comprehensive introduction to graph theory and its applications. It contains all the standard basic material and develops significant topics and applications, such as: colorings and the timetabling problem, matchings and the optimal assignment problem, and Hamiltonian cycles and the traveling salesman problem, to name but a few. Exercises at various levels are given at the end of each chapter, and a final chapter presents a few general problems with hints for solutions, thus providing the reader with the opportunity to test and refine their knowledge on the"]