Graph Drawing and Network Visualization

Pavel Valtr

ISBN 10: 3030687651 / ISBN 13: 9783030687656

Verlag: Springer International Publishing, Springer Nature Switzerland Feb 2021, 2021

Beschreibung

Neuware -This book constitutes the refereed proceedings of the 28th International Symposium on Graph Drawing and Network Visualization, GD 2020, which was held during September 16-18, 2020. The conference was planned to take place in Vancouver, Canada, but changed to an online format due to the COVID-19 pandemic.The 29 full and 9 short papers presented in this volume were carefully reviewed and selected from 82 submissions. They were organized in topical sections named: gradient descent and queue layouts; drawing tree-like graphs, visualization, and special drawings of elementary graphs; restricted drawings of special graph classes; orthogonality; topological constraints; crossings, k-planar graphs; planarity; graphs drawing contest.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 564 pp. Englisch.

Bestandsnummer des Verkäufers 9783030687656

Bibliografische Details

• Titel: Graph Drawing and Network Visualization
• Verlag: Springer International Publishing, Springer Nature Switzerland Feb 2021
• Erscheinungsjahr: 2021
• Sprache: Englisch
• ISBN-10: 3030687651
• ISBN-13: 9783030687656
• Einband: Taschenbuch
• Zustand: Neu

Über diesen Titel

Inhaltsangabe

This book constitutes the refereed proceedings of the 28th International Symposium on Graph Drawing and Network Visualization, GD 2020, which was held during September 16-18, 2020. The conference was planned to take place in Vancouver, Canada, but changed to an online format due to the COVID-19 pandemic.

The 29 full and 9 short papers presented in this volume were carefully reviewed and selected from 82 submissions. They were organized in topical sections named: gradient descent and queue layouts; drawing tree-like graphs, visualization, and special drawings of elementary graphs; restricted drawings of special graph classes; orthogonality; topological constraints; crossings, k-planar graphs; planarity; graphs drawing contest.