Описание: This book constitutes the refereed post-conference proceedings of the 6th International Symposium on Algorithmic Aspects of Cloud Computing, ALGOCLOUD 2021, held in Lisbon, Portugal, in September 2021.
Описание: This volume constitutes selected papers from the Second International Conference on Information Systems and Design, ICID 2021, held as virtual event in September 2021. They are organized in topical sections on digital transformation of enterprises based on analysis and management tools: practical-focused research;
Автор: Daniel Archambault; Csaba D. T?th Название: Graph Drawing and Network Visualization ISBN: 3030358011 ISBN-13(EAN): 9783030358013 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
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-)Confluent 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.- Efficient Generation of Different 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 Classification 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?.
Описание: This book constitutes the refereed proceedings of the 19th Symposium on High Performance Computing System, WSCAD 2018, held in Sao Paulo, Brazil, in October 2018. The papers included in this book are organized according to the following topics: cloud computing;
Описание: This book constitutes the refereed post-conference proceedings of the 21st International Conference on Membrane Computing, CMC 2020, held as a virtual event, in September 2020. The 10 full papers presented were selected from 31 submissions. The papers deal with all aspects on membrane computing and related areas.
Описание: This book constitutes the refereed proceedings of the 42nd German Conference on Pattern Recognition, DAGM GCPR 2020, which took place during September 28 until October 1, 2020.
Описание: 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. drawing tree-like graphs, visualization, and special drawings of elementary graphs; restricted drawings of special graph classes; graphs drawing contest.
Описание: This book constitutes the refereed post-conference proceedings of the 7th Russian Supercomputing Days, RuSCDays 2021, held in Moscow, Russia, in September 2021.The 37 revised full papers and 3 short papers presented were carefully reviewed and selected from 99 submissions.
Описание: This book constitutes selected papers from the First International Symposium on Geometry and Vision, ISGV 2021, held in Auckland, New Zealand, in January 2021. They cover topics in areas of digital geometry, graphics, image and video technologies, computer vision, and multimedia technologies.
Описание: Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set.- Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation.- Block Elimination Distance.- On Fair Covering and Hitting Problems.- On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem.- FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More.- Disjoint Stable Matchings in Linear Time.- Complementation in T-perfect Graphs.- On subgraph complementation to H-free graphs.- Odd Cycle Transversal in Mixed Graphs.- Preventing Small $(s, t)$-Cuts by Protecting Edges.- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel.- A heuristic approach to the treedepth decomposition problem for large graphs.- The Perfect Matching Cut Problem Revisited.- The Complexity of Gerrymandering Over Graphs: Paths and Trees.- Feedback Vertex Set on Hamiltonian Graphs.- Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality.- The Dynamic Complexity of Acyclic Hypergraph Homomorphisms.- Linearizable special cases of the quadratic shortest path problem.- A Linear-time Parameterized Algorithm for Computing the Width of a DAG.- On Morphing 1-Planar Drawings.- Bears with Hats and Independence Polynomials.- The Largest Connected Subgraph Game.- Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries.- Beyond Helly graphs: the diameter problem on absolute retracts.- Acyclic, Star, and Injective Colouring: Bounding the Diameter.- The Graphs of Stably Matchable Pairs.- On additive spanners in weighted graphs with local error.- Labeling Schemes for Deterministic Radio Multi-Broadcast.- On 3-Coloring of (2P_4, C_5)-Free Graphs.
Автор: Hu Название: Graph Drawing and Network Visualization ISBN: 3319501054 ISBN-13(EAN): 9783319501055 Издательство: Springer Рейтинг: Цена: 11460.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes revised selected papers from the 24th International Symposium on Graph Drawing and Network Visualization, GD 2016, held in Athens, Greece, in September 2016. They were organized in topical sections named: large graphs and clutter avoidance; planar graphs, layered and tree drawings; dynamic graphs, contest report.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
