Beyond Planar Graphs

Communications of NII Shonan Meetings

Inbunden, Engelska, 2020

1 073 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2020-10-01
Mått:155 x 235 x 21 mm
Vikt:588 g
Format:Inbunden
Språk:Engelska
Antal sidor:270
Upplaga:20001
Förlag:Springer Verlag, Singapore
ISBN:9789811565328

Utforska kategorier

Mer om författaren

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.

Innehållsförteckning

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.