Beyond Planar Graphs

Communications of NII Shonan Meetings
1. Auflage 2020
ISBN: 978-981-15-6535-9
Verlag: Springer Nature Singapore

Buch, Englisch, 270 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 429 g

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.

Zielgruppe

Research

Autoren/Hrsg.

Tokuyama, Takeshi

Hong, Seok-Hee

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Theoretische Informatik
• Mathematik | Informatik Mathematik Operations Research Graphentheorie
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker

Inhaltsverzeichnis

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.

Über Autor(innen)

Seok-Hee Hong is a professor in the School of Computer Science at the University of Sydney. She has been a member of the ARC College of Experts, an ARC future fellow, a Humboldt fellow, an ARC research fellow, and a project leader of the VALACON (Visualisation and Analysis of Large and Complex Networks) project at NICTA (National ICT Australia). Her main research interests include graph drawing, algorithms, information visualisation and visual analytics.

Takeshi Tokuyama is a professor in the School of Science and Engineering at Kwansei Gakuin University. Previously, he worked for the IBM Tokyo Research Laboratory and Tohoku University. His main research interest is theoretical computer science with its applications. He is a fellow of IPSJ (Information Society of Japan) and IEICE (Institute of Electronics, Information and Communication Engineers) and a senior member of the Academic Council of Japan.