scientific article; zbMATH DE number 5279354

zbMath1153.05036MaRDI QIDQ5387656

Vida Dujmović, David R. Wood

Publication date: 27 May 2008

Full work available at URL: https://eudml.org/doc/129512

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

total ordertrack numberstack number3d polyline grid drawinggrapg subdivisionk-queue layoutk-stack layoutk-track layoutqueue numbersthickness of bipartite graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (35)

Parameterized Algorithms for Queue Layouts ⋮ Twin-width II: small classes ⋮ (3,2)-Track Layout of Bipartite Graph Subdivisions ⋮ Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number ⋮ Stack-number is not bounded by queue-number ⋮ The mixed page number of graphs ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ Layered separators in minor-closed graph classes with applications ⋮ Separating layered treewidth and row treewidth ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Topological Graph Layouts into a Triangular Prism ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ On the pagenumber of the cube-connected cycles ⋮ Track Layout Is Hard ⋮ The biplanar tree graph ⋮ Mixed Linear Layouts of Planar Graphs ⋮ Upward Partitioned Book Embeddings ⋮ The queue-number of posets of bounded width or height ⋮ Graph layouts via layered separators ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ Planar projections of graphs ⋮ Data Structures and their Planar Graph Layouts ⋮ Track layouts, layered path decompositions, and leveled planarity ⋮ Cubic Planar Graphs that cannot be Drawn on few Lines ⋮ On the queue-number of graphs with bounded tree-width ⋮ Layouts of Expander Graphs ⋮ Upward three-dimensional grid drawings of graphs ⋮ Queue layouts of planar 3-trees ⋮ Queue layouts of planar 3-trees ⋮ Volume requirements of 3D upward drawings ⋮ Upward Book Embeddings of st-Graphs ⋮ Planar Graphs of Bounded Degree Have Bounded Queue Number ⋮ Characterizations of Deque and Queue Graphs ⋮ Graph Classes and Forbidden Patterns on Three Vertices ⋮ Parameterized Algorithms for Queue Layouts

This page was built for publication: