Daniel Archambault; Csaba D. T?th Graph Drawing and Network Visualization 9783030358013

Варианты приобретения

Цена: 6986.00р.
Кол-во:
Наличие: Поставка под заказ. Есть в наличии на складе поставщика.
Склад Америка: Есть
При оформлении заказа до: 2025-08-18
Ориентировочная дата поставки: конец Сентября - начало Октября
При условии наличия книги у поставщика.

Добавить в корзину

в Мои желания

Автор: Daniel Archambault; Csaba D. T?th
Название: Graph Drawing and Network Visualization
ISBN: 9783030358013
Издательство: Springer
Классификация:

Теория информации

Алгоритмы и структуры данных

Математика для специалистов в области теории вычислительных систем

Обработка изображений

ISBN-10: 3030358011
Обложка/Формат: Soft cover
Страницы: 626
Вес: 0.99 кг.
Дата издания: 2019
Серия: Theoretical Computer Science and General Issues
Язык: English
Издание: 1st ed. 2019
Иллюстрации: 244 illustrations, color; 216 illustrations, black and white; xxiii, 626 p. 460 illus., 244 illus. in color.
Размер: 234 x 156 x 33
Читательская аудитория: Professional & vocational
Основная тема: Computer Science
Подзаголовок: 27th International Symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019, Proceedings
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание:

Cartograms and Intersection Graphs.- Stick Graphs with Length Constraints.- Representing Graphs and Hypergraphs by Touching Polygons in 3D.- Optimal Morphs of Planar Orthogonal Drawings II.- Computing Stable Demers Cartograms.- Geometric Graph Theory.- Bundled Crossings Revisited.- Crossing Numbers of Beyond-Planar Graphs.- On the 2-Colored Crossing Number.- Minimal Representations of Order Types by Geometric Graphs.- Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators.- Clustering.- A Quality Metric for Visualization of Clusters in Graphs.- Multi-level Graph Drawing using Infomap Clustering.- On Strict (Outer-)Conﬂuent Graphs.- Quality Metrics.- On the Edge-Length Ratio of Planar Graphs.- Node Overlap Removal Algorithms: A Comparative Study.- Graphs with large total angular resolution.- Arrangements.- Computing Height-Optimal Tangles Faster.- On Arrangements of Orthogonal Circles.- Extending Simple Drawings.- Coloring Hasse diagrams and disjointness graphs of curves.- A Low Number of Crossings.- Eﬃcient Generation of Diﬀerent Topological Representations of Graphs Beyond-Planarity.- The QuaSEFE Problem.- ChordLink: A New Hybrid Visualization Model.- Stress-Plus-X (SPX) Graph Layout.- Best Paper in Track 1.- Exact Crossing Number Parameterized by Vertex Cover.- Morphing and Planarity.- Maximizing Ink in Partial Edge Drawings of k-Plane Graphs.- Graph Drawing with Morphing Partial Edges.- A Note on Universal Point Sets for Planar Graphs.- Parameterized Complexity.- Parameterized Algorithms for Book Embedding Problems.- Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs.- Collinearities.- 4-Connected Triangulations on Few Lines.- Line and Plane Cover Numbers Revisited.- Drawing planar graphs with few segments on a polynomial grid.- Variants of the Segment Number of a Graph.- Topological Graph Theory.- Local and Union Page Numbers.- Mixed Linear Layouts: Complexity, Heuristics, and Experiments.- Homotopy height, grid-major height and graph-drawing height.- On the Edge-Vertex Ratio of Maximal Thrackles.- Best Paper in Track 2.- Symmetry Detection and Classiﬁcation in Drawings of Graphs.- Level Planarity.- An SPQR-Tree-Like Embedding Representation for Upward Planarity.- A Natural Quadratic Approach to the Generalized Graph Layering Problem.- Graph Stories in Small Area.- Level-Planar Drawings with Few Slopes.- Graph Drawing Contest Report.- Graph Drawing Contest Report.- Poster Abstracts.- A 1-planarity Testing and Embedding Algorithm.- Stretching Two Pseudolines in Planar Straight-Line Drawings.- Adventures in Abstraction: Reachability in Hierarchical Drawings.- On Topological Book Embedding for k-Plane Graphs.- On Compact RAC Drawings.- FPQ-choosable Planarity Testing.- Packing Trees into 1-Planar Graphs.- Geographic Network Visualization Techniques: A Work-In-Progress Taxonomy.- On the Simple Quasi Crossing Number of K 11.- Minimising Crossings in a Tree-Based Network.- Crossing Families and Their Generalizations.- Which Sets of Strings are Pseudospherical?.

Дополнительное описание: Cartograms and Intersection Graphs.- Stick Graphs with Length Constraints.- Representing Graphs and Hypergraphs by Touching Polygons in 3D.- Optimal Morphs of Planar Orthogonal Drawings II.- Computing Stable Demers Cartograms.- Geometric Graph Theory.- Bu

Graph Drawing and Network Visualization, Daniel Archambault; Csaba D. T?th