{"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":22,"n_cols":5,"rows_kept":22,"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],[3,2,3,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[11,2,11,3],[12,2,12,3],[16,2,16,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910450789603321"]
[null,null,"Titolo",null,"Graph algorithms and applications 5 [[electronic resource] /] / editors, Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis"]
[null,null,"Pubbl/distr/stampa",null,"Singapore ; ; Hackensack, N.J., : World Scientific, c2006"]
[null,null,"ISBN",null,"1-281-92466-0"]
[{"$nulls":4},"9786611924669"]
[{"$nulls":4},"981-277-328-2"]
[null,null,"Descrizione fisica",null,"1 online resource (378 p.)"]
[null,null,"Disciplina",null,"005.133"]
[null,null,"Soggetti",null,"Graph algorithms"]
[{"$nulls":4},"Graph theory"]
[{"$nulls":4},"Electronic books."]
[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","\"This book contains volume 8 of the Journal of graph algorithms and applications (JGAA)\"--Pref."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"Contents               ; Volume 8:1 (2004)                        ; Drawing Planar Graphs with Large Vertices and Thick Edges                                                                ; The Maximum Number of Edges in a Three-Dimensional Grid-Drawing                                                                      ; Extreme Distances in Multicolored Point Sets                                                   ; Fast Approximation of Centrality                                       ; I/O-Optimal Algorithms for Outerplanar Graphs"]
[{"$nulls":4},"A Note on Rectilinearity and Angular Resolution                                                      The Star Clustering Algorithm for Static and Dynamic Information Organization                                                                                    ; Volume 8:2 (2004)                        ; Special Issue on Selected Papers from the Tenth International Symposium on Graph Drawing GD 2002"]
[{"$nulls":4},"Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio                                                                                         Drawing Graphs on Two and Three Lines. Sabine Cornelsen Thomas Schank and Dorothea Wagner                                                                                                ; Simple and Efficient Bilayer Cross Counting. Wilhelm Barth Petra Mutzel and Michael Jiinger"]
[{"$nulls":4},"Graph Drawing by High-Dimensional Embedding                                                  Computing and Drawing Isomorphic Subgraphs                                                 ; Volume 8:3 (2004)                        ; On the Cutting Edge: Simplified O(n) Planarity by Edge Addition                                                                      ; Algorithms for Single Link Failure Recovery and Related Problems"]
[{"$nulls":4},"NP-Completeness of Minimal Width Unordered Tree Layout                                                             Algorithm and Experiments in Testing Planar Graphs for Isomorphism                                                                         ; Three-Dimensional 1-Bend Graph Drawings"]
[null,null,null,"Sommario/riassunto","This book contains Volume 8 of the <i>Journal of Graph Algorithms and Applications</i> <i>(JGAA)</i><i>. JGAA</i> is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. Areas of interest include computational biology, computational geometry, computer graphics, computer-aided design, computer and interconnection networks, constraint systems, databases, graph drawing, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications ne"]