國立虎尾科技大學 |

Beyond Planar Graphs = Communications of NII Shonan Meetings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Beyond Planar Graphs/ edited by Seok-Hee Hong, Takeshi Tokuyama.
其他題名:	Communications of NII Shonan Meetings /
其他作者:	Tokuyama, Takeshi.
面頁冊數:	VIII, 270 p. 130 illus., 48 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Graph Theory. -
電子資源:	https://doi.org/10.1007/978-981-15-6533-5
ISBN:	9789811565335

Beyond Planar Graphs = Communications of NII Shonan Meetings /
Beyond Planar GraphsCommunications of NII Shonan Meetings /[electronic resource] :edited by Seok-Hee Hong, Takeshi Tokuyama. - 1st ed. 2020. - VIII, 270 p. 130 illus., 48 illus. in color.online resource.

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.

ISBN: 9789811565335

Standard No.: 10.1007/978-981-15-6533-5doiSubjects--Topical Terms:

786670
Graph Theory.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Beyond Planar Graphs = Communications of NII Shonan Meetings /
LDR:03668nam a22004095i 4500 001 1029941
003 DE-He213
005 20200930145056.0
007 cr nn 008mamaa
008 210318s2020 si | s |||| 0|eng d
020 $a 9789811565335 $9 978-981-15-6533-5
024 7 $a 10.1007/978-981-15-6533-5 $2 doi
035 $a 978-981-15-6533-5
050 4 $a QA76.9.M35
072 7 $a PBD $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a PBD $2 thema
072 7 $a UYAM $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Beyond Planar Graphs $h [electronic resource] : $b Communications of NII Shonan Meetings / $c edited by Seok-Hee Hong, Takeshi Tokuyama.
250 $a 1st ed. 2020.
264 1 $a Singapore : $b Springer Singapore : $b Imprint: Springer, $c 2020.
300 $a VIII, 270 p. 130 illus., 48 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a 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. .
520 $a 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.
650 2 4 $a Graph Theory. $3 786670
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 0 $a Graph theory. $3 527884
650 0 $a Computer science—Mathematics. $3 1253519
700 1 $a Tokuyama, Takeshi. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1074187
700 1 $a Hong, Seok-Hee. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 678708
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9789811565328
776 0 8 $i Printed edition: $z 9789811565342
776 0 8 $i Printed edition: $z 9789811565359
856 4 0 $u https://doi.org/10.1007/978-981-15-6533-5
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)