Beyond Planar Graphs : Communications of NII Shonan Meetings / edited by Seok-Hee Hong, Takeshi Tokuyama.

Format:

Book

Contributor:

Hong, Seok-Hee, editor.

Tokuyama, Takeshi, editor.

SpringerLink (Online service)

Series:

Computer Science (SpringerNature-11645)

Language:

English

Subjects (All):

Computer science--Mathematics.

Computer science.

Graph theory.

Discrete Mathematics in Computer Science.

Graph Theory.

Local Subjects:

Discrete Mathematics in Computer Science.

Graph Theory.

Physical Description:

1 online resource (VIII, 270 pages) : 130 illustrations, 48 illustrations in color

Edition:

First edition 2020.

Contained In:

Springer Nature eBook

Place of Publication:

Singapore : Springer Singapore : Imprint: Springer, 2020.

System Details:

text file PDF

Summary:

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.

Contents:

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. .

Other Format:

Printed edition:

ISBN:

978-981-15-6533-5

9789811565335

Access Restriction:

Restricted for use by site license.