01328nam0 22003251i 450 SUN003388220110405101046.50432-14-00204-x20050310d1993 |0engc50 baengGB|||| |||||International human rightsdocuments and introductory notesedited and annotated by Felix Ermacora, Manfred Nowak, Hannes TretterViennaLaw books in EuropeLondonSweet & Maxwell1993vii, 343 p.24 cm.Diritti umaniLegislazione internazionaleFISUNC005195GBLondonSUNL000015ViennaSUNL000107341.48102621Ermacora, FelixSUNV028449Nowak, ManfredSUNV028450Tretter, HannesSUNV028451Sweet & MaxwellSUNV001739650Law books in EuropeSUNV004863650ITSOL20181109RICASUN0033882UFFICIO DI BIBLIOTECA DEL DIPARTIMENTO DI GIURISPRUDENZA00 CONS XIII.El.48 00 6417 UFFICIO DI BIBLIOTECA DEL DIPARTIMENTO DI GIURISPRUDENZA6417CONS XIII.El.48paInternational human rights748990UNICAMPANIA03535nam 2200445 450 99646536340331620210301124028.0981-15-6533-310.1007/978-981-15-6533-5(CKB)5590000000002281(MiAaPQ)EBC6362066(DE-He213)978-981-15-6533-5(PPN)250219522(EXLCZ)99559000000000228120210301d2020 uy 0engurnn|008mamaatxtrdacontentcrdamediacrrdacarrierBeyond planar graphs communications of NII Shonan meetings /Seok-Hee Hong, Takeshi Tokuyama, editors1st ed. 2020.Gateway East, Singapore :Springer,[2020]©20201 online resource (VIII, 270 p. 130 illus., 48 illus. in color.) 981-15-6532-5 Chapter 1: Introduction -- Chapter 2: Quantitative Restrictions on Crossing Patterns -- Chapter 3: Quasi-planar Graphs -- Chapter 4: 1-Planar Graphs -- Chapter 5: Algorithms for 1-planar Graphs -- Chapter 6:^= 2 -- Chapter 8: Fan-Planarity -- Chapter 9: Right Angle Crossing Drawings of Graphs -- Chapter 10: Angular Resolutions -- Chapter 11: Crossing Layout in Non-Planar Graph Drawings -- Chapter 12: Beyond Clustered Planarity -- Chapter: Simultaneous Embedding. .This book is the first general and extensive review on the algorithmics and mathematical results of beyond planar graphs. Most real-world data sets are relational and can be modelled as graphs consisting of vertices and edges. Planar graphs are fundamental for both graph theory and graph algorithms and are extensively studied. Structural properties and fundamental algorithms for planar graphs have been discovered. However, most real-world graphs, such as social networks and biological networks, are non-planar. To analyze and visualize such real-world networks, it is necessary to solve fundamental mathematical and algorithmic research questions on sparse non-planar graphs, called beyond planar graphs.This book is based on the National Institute of Informatics (NII) Shonan Meeting on algorithmics on beyond planar graphs held in Japan in November, 2016. The book consists of 13 chapters that represent recent advances in various areas of beyond planar graph research. The main aims and objectives of this book include 1) to timely provide a state-of-the-art survey and a bibliography on beyond planar graphs; 2) to set the research agenda on beyond planar graphs by identifying fundamental research questions and new research directions; and 3) to foster cross-disciplinary research collaboration between computer science (graph drawing and computational geometry) and mathematics (graph theory and combinatorics). New algorithms for beyond planar graphs will be in high demand by practitioners in various application domains to solve complex visualization problems. This book therefore will be a valuable resource for researchers in graph theory, algorithms, and theoretical computer science, and will stimulate further deep scientific investigations into many areas of beyond planar graphs.Graph algorithmsGraph algorithms.511.5Hong Seok-HeeTokuyama TakeshiMiAaPQMiAaPQMiAaPQBOOK996465363403316Beyond planar graphs2095531UNISA