## Upward Drawings on Planes and Spheres
Hashemi, S. Mehdi and Kisielewicz, Andrzej and Rival, Ivan
(1996)
Full text not available from this repository. ## AbstractAlthough there is a linear time algorithm to decide whether an ordered set has an upward drawing on a surface topologically equivalent to a sphere, we shall prove that the decision problem whether an ordered set has an upward drawing on a sphere itself is NP-complete. To this end we explore the surface topology of ordered sets highlighting especially the role of their saddle points.
Repository Staff Only: item control page References |