000 | 04208nam a22005535i 4500 | ||
---|---|---|---|
001 | 978-981-15-6533-5 | ||
003 | DE-He213 | ||
005 | 20240423125323.0 | ||
007 | cr nn 008mamaa | ||
008 | 200930s2020 si | s |||| 0|eng d | ||
020 |
_a9789811565335 _9978-981-15-6533-5 |
||
024 | 7 |
_a10.1007/978-981-15-6533-5 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
050 | 4 | _aQA297.4 | |
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aPBD _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYAM _2thema |
|
072 | 7 |
_aPBD _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aBeyond Planar Graphs _h[electronic resource] : _bCommunications of NII Shonan Meetings / _cedited by Seok-Hee Hong, Takeshi Tokuyama. |
250 | _a1st ed. 2020. | ||
264 | 1 |
_aSingapore : _bSpringer Nature Singapore : _bImprint: Springer, _c2020. |
|
300 |
_aVIII, 270 p. 130 illus., 48 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
505 | 0 | _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. . | |
520 | _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. | ||
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aGraph theory. | |
650 | 1 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aGraph Theory. |
700 | 1 |
_aHong, Seok-Hee. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aTokuyama, Takeshi. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9789811565328 |
776 | 0 | 8 |
_iPrinted edition: _z9789811565342 |
776 | 0 | 8 |
_iPrinted edition: _z9789811565359 |
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-981-15-6533-5 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
942 | _cSPRINGER | ||
999 |
_c176674 _d176674 |