Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 3 of 3
Full-Text Articles in Mathematics
Outerplanar Crossing Numbers, The Circular Arrangement Problem And Isoperimetric Functions, Eva Czabarka, Ondrej Sykora, Laszlo A. Szekely, Imrich Vrt'o
Outerplanar Crossing Numbers, The Circular Arrangement Problem And Isoperimetric Functions, Eva Czabarka, Ondrej Sykora, Laszlo A. Szekely, Imrich Vrt'o
Faculty Publications
We extend the lower bound in [15] for the outerplanar crossing number (in other terminologies also called convex, circular and one-page book crossing number) to a more general setting. In this setting we can show a better lower bound for the outerplanar crossing number of hypercubes than the best lower bound for the planar crossing number. We exhibit further sequences of graphs, whose outerplanar crossing number exceeds by a factor of log n the planar crossing number of the graph. We study the circular arrangement problem, as a lower bound for the linear arrangement problem, in a general fashion. We …
Every Polynomial-Time 1-Degree Collapses If And Only If P=Pspace, Stephen A. Fenner, Stuart A. Kurtz, James S. Royer
Every Polynomial-Time 1-Degree Collapses If And Only If P=Pspace, Stephen A. Fenner, Stuart A. Kurtz, James S. Royer
Faculty Publications
No abstract provided.
Every Polynomial-Time 1-Degree Collapses If And Only If P=Pspace, Stephen A. Fenner, Stuart A. Kurtz, James S. Royer
Every Polynomial-Time 1-Degree Collapses If And Only If P=Pspace, Stephen A. Fenner, Stuart A. Kurtz, James S. Royer
Faculty Publications
No abstract provided.