LEADER 03537nam 2200445 450 001 9910427694203321 005 20210301124028.0 010 $a981-15-6533-3 024 7 $a10.1007/978-981-15-6533-5 035 $a(CKB)5590000000002281 035 $a(MiAaPQ)EBC6362066 035 $a(DE-He213)978-981-15-6533-5 035 $a(PPN)250219522 035 $a(EXLCZ)995590000000002281 100 $a20210301d2020 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aBeyond planar graphs $ecommunications of NII Shonan meetings /$fSeok-Hee Hong, Takeshi Tokuyama, editors 205 $a1st ed. 2020. 210 1$aGateway East, Singapore :$cSpringer,$d[2020] 210 4$dİ2020 215 $a1 online resource (VIII, 270 p. 130 illus., 48 illus. in color.) 311 $a981-15-6532-5 327 $aChapter 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. . 330 $aThis 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. 606 $aGraph algorithms 615 0$aGraph algorithms. 676 $a511.5 702 $aHong$b Seok-Hee 702 $aTokuyama$b Takeshi 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910427694203321 996 $aBeyond planar graphs$92095531 997 $aUNINA