Graphs with E Edges Have Pagenumber O(√E)
From MaRDI portal
Publication:4304061
DOI10.1006/jagm.1994.1027zbMath0810.68102OpenAlexW1984825279WikidataQ29396264 ScholiaQ29396264MaRDI QIDQ4304061
Publication date: 8 September 1994
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1994.1027
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (27)
Algorithms for the fixed linear crossing number problem ⋮ A survey on book-embedding of planar graphs ⋮ Stack-number is not bounded by queue-number ⋮ Graph drawings with few slopes ⋮ The mixed page number of graphs ⋮ An annotated bibliography on 1-planarity ⋮ The book thickness of 1-planar graphs is constant ⋮ RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties ⋮ On the Page Number of Upward Planar Directed Acyclic Graphs ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Crossings in grid drawings ⋮ Book embeddings of \(k\)-framed graphs and \(k\)-map graphs ⋮ Stack and queue number of 2-trees ⋮ On graph thickness, geometric thickness, and separator theorems ⋮ Stack and Queue Layouts via Layered Separators ⋮ Efficient deterministic algorithms for embedding graphs on books ⋮ Local and union page numbers ⋮ Geometric thickness in a grid ⋮ Approximating the fixed linear crossing number ⋮ The pagenumber of the class of bandwidth-k graphs is \(k-1\) ⋮ An analysis of some linear graph layout heuristics ⋮ On dispersable book embeddings ⋮ Upward Book Embeddings of st-Graphs ⋮ Book Embedding of Graphs on the Projective Plane ⋮ Book Embeddings of Regular Graphs ⋮ Geometric Thickness in a Grid of Linear Area ⋮ Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings
This page was built for publication: Graphs with E Edges Have Pagenumber O(√E)
