Stacks, queues and tracks: layouts of graph subdivisions
From MaRDI portal
(Redirected from Publication:5387656)
3d polyline grid drawinggrapg subdivisionk-queue layoutk-stack layoutk-track layoutqueue numbersstack numberthickness of bipartite graphtotal ordertrack number
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
Cited in
(46)- Volume requirements of 3D upward drawings
- The queue-number of posets of bounded width or height
- Track layouts, layered path decompositions, and leveled planarity
- 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
- The biplanar tree graph
- Layered separators in minor-closed graph classes with applications
- Upward three-dimensional grid drawings of graphs
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Topological graph layouts into a triangular prism
- Track layout is hard
- Characterizations of deque and queue graphs
- scientific article; zbMATH DE number 431507 (Why is no real title available?)
- Layouts of Expander Graphs
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Mixed linear layouts of planar graphs
- Upward partitioned book embeddings
- Data Structures and their Planar Graph Layouts
- scientific article; zbMATH DE number 2159655 (Why is no real title available?)
- Graph layouts via layered separators
- Parameterized Algorithms for Queue Layouts
- Parameterized algorithms for queue layouts
- Twin-width II: small classes
- Upward book embeddings of st-graphs
- Cubic Planar Graphs that cannot be Drawn on few Lines
- On the queue-number of graphs with bounded tree-width
- Planar graphs of bounded degree have bounded queue number
- (3,2)-Track Layout of Bipartite Graph Subdivisions
- Graph Drawing
- Graph classes and forbidden patterns on three vertices
- Queue layouts of planar 3-trees
- Queue layouts of planar 3-trees
- Separating layered treewidth and row treewidth
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Shallow Minors, Graph Products, and Beyond-Planar Graphs
- On the pagenumber of the cube-connected cycles
- Three-dimensional graph products with unbounded stack-number
- Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover
- Characterisations and examples of graph classes with bounded expansion
- Stack and queue numbers of graphs revisited
- Stack and queue numbers of graphs revisited
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
This page was built for publication: Stacks, queues and tracks: layouts of graph subdivisions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387656)