scientific article
From MaRDI portal
Publication:3102944
zbMath1275.68033MaRDI QIDQ3102944
No author found.
Publication date: 25 November 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Graph algorithms (graph-theoretic aspects) (05C85) Mathematics and visual arts (00A66)
Related Items (38)
Recognizing and drawing IC-planar graphs ⋮ HV-planarity: algorithms and complexity ⋮ Drawing Planar Graphs with Prescribed Face Areas ⋮ Alternating paths and cycles of minimum length ⋮ On Edge-Length Ratios of Partial 2-Trees ⋮ How traders influence their neighbours: modelling social evolutionary processes and peer effects in agricultural trade networks ⋮ An annotated bibliography on 1-planarity ⋮ The topological drawing of a graph: construction methods ⋮ On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps ⋮ Universal slope sets for 1-bend planar drawings ⋮ Erdős-Hajnal conjecture for graphs with bounded VC-dimension ⋮ Synchronized Planarity with Applications to Constrained Planarity Problems ⋮ The shape of orthogonal cycles in three dimensions ⋮ An annotated review on graph drawing and its applications ⋮ Defying gravity and gadget numerosity: the complexity of the Hanano puzzle ⋮ Methods for determining cycles of a specific length in undirected graphs with edge weights ⋮ Minimal Delaunay triangulations of hyperbolic surfaces ⋮ Bend-optimal orthogonal drawings of triconnected plane graphs ⋮ An Experimental Study on the Ply Number of Straight-Line Drawings ⋮ Finding Triangles for Maximum Planar Subgraphs ⋮ An Experimental Study on the Ply Number of Straight-line Drawings ⋮ Polynomial area bounds for MST embeddings of trees ⋮ On Upward Drawings of Trees on a Given Grid ⋮ Image-based graph visualization: advances and challenges ⋮ A heuristic approach towards drawings of graphs with high crossing resolution ⋮ The complexity of drawing a graph in a polygonal region ⋮ Grid drawings of graphs with constant edge-vertex resolution ⋮ EVOLUTIONARILY-FRAGMENTED ALGORITHM FOR FINDING A MAXIMAL FLAT PART OF A GRAPH ⋮ PLANARITY TESTING AND CONSTRUCTING THE TOPOLOGICAL DRAWING OF A PLANE GRAPH (DFS) ⋮ Characterizing and recognizing 4-map graphs ⋮ On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings ⋮ Computing β-Drawings of 2-Outerplane Graphs in Linear Time ⋮ Level-planar drawings with few slopes ⋮ Geometry and Generation of a New Graph Planarity Game ⋮ Invariants of graph drawings in the plane ⋮ Planar drawings of fixed-mobile bigraphs ⋮ Crossing Layout in Non-planar Graph Drawings ⋮ On the Edge-Length Ratio of 2-Trees
Uses Software
This page was built for publication:
