The complexity of upward drawings on spheres

DOI10.1023/A:1006095702164zbMath0913.06001OpenAlexW206077490MaRDI QIDQ1272953

S. Mehdi Hashemi, Ivan Rival, Andrzej P. Kisielewicz

Publication date: 7 March 1999

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1006095702164

zbMATH Keywords

sphereordered setsaddle pointNP-complete problemupward drawingsurface topology of ordered sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06)

Related Items (7)

Upward planar drawings on the standing and the rolling cylinders ⋮ Classification of Planar Upward Embedding ⋮ On the sphericity testing of single source digraphs ⋮ Upward planar graphs and their duals ⋮ On the upward embedding on the torus ⋮ Obituary: Ivan Rival ⋮ Radial Level Planarity with Fixed Embedding

This page was built for publication: The complexity of upward drawings on spheres