東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Beyond planar graphs = communication...

Hong, Seok-Hee.

Linked to FindBook

Google Book

Amazon

博客來

Beyond planar graphs = communications of NII Shonan meetings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Beyond planar graphs/ edited by Seok-Hee Hong, Takeshi Tokuyama.
Reminder of title:	communications of NII Shonan meetings /
other author:	Hong, Seok-Hee.
Published:	Singapore :Springer Singapore : : 2020.,
Description:	viii, 270 p. :ill., digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer Nature eBook
Subject:	Graph algorithms. -
Online resource:	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. - Singapore :Springer Singapore :2020. - viii, 270 p. :ill., digital ;24 cm.

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:

596326
Graph algorithms.

LC Class. No.: QA166.245 / .B488 2020

Dewey Class. No.: 511.5

Beyond planar graphs = communications of NII Shonan meetings /
LDR:03308nmm a2200337 a 4500 001 2243556
003 DE-He213
005 20200930145056.0
006 m d
007 cr nn 008maaau
008 211207s2020 si s 0 eng d
020 $a 9789811565335 $q (electronic bk.)
020 $a 9789811565328 $q (paper)
024 7 $a 10.1007/978-981-15-6533-5 $2 doi
035 $a 978-981-15-6533-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166.245 $b .B488 2020
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 511.5 $2 23
090 $a QA166.245 $b .B573 2020
245 0 0 $a Beyond planar graphs $h [electronic resource] : $b communications of NII Shonan meetings / $c edited by Seok-Hee Hong, Takeshi Tokuyama.
260 $a Singapore : $b Springer Singapore : $b Imprint: Springer, $c 2020.
300 $a viii, 270 p. : $b ill., digital ; $c 24 cm.
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 0 $a Graph algorithms. $3 596326
650 0 $a Graph theory $x Data processing. $3 655277
650 1 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Graph Theory. $3 1567033
700 1 $a Hong, Seok-Hee. $3 901007
700 1 $a Tokuyama, Takeshi. $3 3503679
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-981-15-6533-5
950 $a Computer Science (SpringerNature-11645)