Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	Dezember 2018
Genre:	Schulbücher
	Algorithm Analysis and Problem Complexity / Algorithms / Algorithms & data structures / Artificial Intelligence / C / Computer Graphics / computer science / Computer science—Mathematics / Data Science / Data Structures / Data structures (Computer science) / Datenbanken / Discrete Mathematics / Discrete Mathematics in Computer Science / Diskrete Mathematik / Grafikprogrammierung / Graphics programming / Künstliche Intelligenz / Mathematik für Informatiker / Maths for computer scientists mehr...
ISBN:	9783030044138
EAN-Code:	9783030044138
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#11282 - Lecture Notes in Computer Science Theoretical Computer Science and General Issues
Dimensionen:	H 235 mm / B 155 mm / D 36 mm
Gewicht:	1032 gr
Seiten:	666
Illustration:	XVIII, 666 p. 427 illus., 198 illus. in color., schwarz-weiss Illustrationen, farbige Illustrationen
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Invited Talk.- Image-Based Graph Visualization: Advances and Challenges.- Planarity Variants.- Clustered Planarity = Flat Clustered Planarity.- Level Planarity: Transitivity vs. Even Crossings.- Short Plane Supports for Spatial Hypergraphs.- Turning Cliques into Paths to Achieve Planarity.- Upward Drawings.- Universal Slope Sets for Upward Planar Drawings.- Upward Planar Morphs.- Visualizing the Template of a Chaotic Attractor.- RAC drawings.- On RAC Drawings of Graphs with one Bend per Edge.- Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends.- Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles.- Best paper Track 2.- Aesthetic Discrimination of Graph Layouts.- Orders.- A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width.- The Queue-Number of Posets of Bounded Width or Height.- Queue Layouts of Planar 3-Trees.- Crossings.- Crossing Minimization in Perturbed Drawings.- The Number of Crossings in Multigraphs with No Empty Lens.- Crossing Numbers and Stress of Random Graphs.- Crossing angles.- A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution.- A Greedy Heuristic for Crossing-Angle Maximization.- Contact representations.- Recognition and Drawing of Stick Graphs.- On Contact Graphs of Paths on a Grid.- Specialized graphs and trees.- On the Area-Universality of Triangulations.- Monotone Drawings of k-Inner Planar Graphs.- On L-shaped Point Set Embeddings of Trees: First Non-embeddable Examples.- How to Fit a Tree in a Box.- Best paper Track 1.- Pole Dancing: 3D Morphs for Tree Drawings.- Partially fixed drawings.- The Complexity of Drawing a Graph in a Polygonal Region.- Inserting an Edge into a Geometric Embedding.- ss-Stars or On Extending a Drawing of a Connected Subgraph.- Experiments.- Perception of Symmetries in Drawings of Graphs.- Network Alignment by DiscreteOllivier-Ricci Flow.- Same Stats, Different Graphs (Graph Statistics and Why We Need Graph Drawings).- Orthogonal drawings.- Bend-minimum Orthogonal Drawings in Quadratic Time.- Greedy Rectilinear Drawings.- Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity.- Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs.- Realizability.- Realization and Connectivity of the Graphs of Origami Flat Foldings.- Arrangements of Pseudocircles: On Circularizability.- The Weighted Barycenter Drawing Recognition Problem.- Miscellaneous.- Algorithms and Bounds for Drawing Directed Graphs.- Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity.- Graph Drawing Contest Report.