On Crossing Sets, Disjoint Sets, and Pagenumber
Authors:
- Farhad ShahrokhiFSFarhad Shahrokhi
- Weiping ShiWSWeiping Shi
- 1 January 2000
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 34 (1) , 40-53
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Quasi-planar graphs have a linear number of edgesCombinatorica, 1997
- Graphs with E Edges Have Pagenumber O(√E)Journal of Algorithms, 1994
- Laying Out Graphs Using QueuesSIAM Journal on Computing, 1992
- A turán-type theorem on chords of a convex polygonJournal of Combinatorial Theory, Series B, 1992
- Comparing Queues and Stacks As Machines for Laying Out GraphsSIAM Journal on Discrete Mathematics, 1992
- The pagenumber of genus g graphs is O( g )Journal of the ACM, 1992
- Disjoint edges in geometric graphsDiscrete & Computational Geometry, 1989
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI DesignSIAM Journal on Algebraic Discrete Methods, 1987
- The Complexity of Coloring Circular Arcs and ChordsSIAM Journal on Algebraic Discrete Methods, 1980
- The book thickness of a graphJournal of Combinatorial Theory, Series B, 1979