Upward book embeddings of st-graphs
From MaRDI portal
Publication:5088940
Recommendations
Cites work
- scientific article; zbMATH DE number 2084286 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 4051024 (Why is no real title available?)
- scientific article; zbMATH DE number 2159644 (Why is no real title available?)
- scientific article; zbMATH DE number 219264 (Why is no real title available?)
- 1-page and 2-page drawings with bounded number of crossings per edge
- A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs
- Advancements on SEFE and partitioned book embedding problems
- Algorithms for plane representations of acyclic digraphs
- An analysis of some linear graph layout heuristics
- Arc diagrams, flip distances, and Hamiltonian triangulations
- Area requirement and symmetry display of planar upward drawings
- Book embeddability of series-parallel digraphs
- Bounds For Orthogonal 3-D Graph Drawing
- Call routing and the ratcatcher
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Computing upward topological book embeddings of upward planar digraphs
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Crossing minimization in linear embeddings of graphs
- Crossing-free acyclic Hamiltonian path completion for planar \(st\)-digraphs
- Crossing-optimal acyclic HP-completion for outerplanar \(st\)-digraphs
- Curve-constrained drawings of planar graphs
- Drawing colored graphs on colored points
- Drawing colored graphs with constrained vertex positions and few bends per edge
- Edge partitions of optimal 2-plane and 3-plane graphs
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine
- Embedding planar graphs in four pages
- Genus g Graphs Have Pagenumber O(√g)
- Graph minors. X: Obstructions to tree-decomposition
- Graphs with E Edges Have Pagenumber O(√E)
- Greedy rectilinear drawings
- Implementing a partitioned 2-page book embedding testing algorithm
- Intersection-link representations of graphs
- Linear-size universal point sets for one-bend drawings
- Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph
- New upper bounds on the decomposability of planar graphs
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
- On the book embedding of ordered sets.
- On the computational complexity of upward and rectilinear planarity testing
- On the page number of upward planar directed acyclic graphs
- On the pagenumber of complete bipartite graphs
- On-Line Planarity Testing
- Optimal Upward Planarity Testing of Single-Source Digraphs
- Ordered sets, pagenumbers and planarity
- Planar L-drawings of directed graphs
- Quasi-upward planarity
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Stack and Queue Layouts of Directed Acyclic Graphs: Part II
- Stack and Queue Layouts of Posets
- Stacks, queues and tracks: layouts of graph subdivisions
- Strip planarity testing for embedded planar graphs
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- The \(2\)-page crossing number of \(K_n\)
- The book thickness of a graph
- The complexity of colouring circle graphs (extended abstract)
- The pagenumber of \(k\)-trees is \(O(k)\)
- Total Ordering Problem
- Two-page book embeddings of 4-planar graphs
- Unilateral orientation of mixed graphs
- Universal Point Sets for Drawing Planar Graphs with Circular Arcs
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- Upward partitioned book embeddings
- Upward planar drawings on the standing and the rolling cylinders
- Upward planar morphs
- Upward spirality and upward planarity testing
- Upward topological book embeddings of DAGs
- Windrose planarity: embedding graphs with direction-constrained edges
Cited in
(13)- On families of planar DAGs with constant stack number
- Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover
- On the upward book thickness problem: combinatorial and complexity results
- A Sublinear Bound on the Page Number of Upward Planar Graphs
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
- Upward partitioned book embeddings
- Recognizing DAGs with page-number 2 is NP-complete
- Parameterized approaches to orthogonal compaction
- Recognizing DAGs with page-number 2 is NP-complete
- On the upward book thickness problem: combinatorial and complexity results
- Upward topological book embeddings of DAGs
This page was built for publication: Upward book embeddings of st-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088940)
