scientific article; zbMATH DE number 6850329
From MaRDI portal
Publication:4607898
zbMath1403.68144arXiv1709.09209MaRDI QIDQ4607898
Radoslav Fulek, Hugo A. Akitaya, Csaba D. Tóth
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1709.09209
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Clustered planarity with pipes ⋮ Clustered planarity = flat clustered planarity ⋮ Crossing minimization in perturbed drawings ⋮ Crossing minimization in perturbed drawings ⋮ Hanani-Tutte for approximating maps of graphs ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Drawing Clustered Planar Graphs on Disk Arrangements
This page was built for publication:
