Pages that link to "Item:Q2505497"
From MaRDI portal
The following pages link to Book embeddability of series-parallel digraphs (Q2505497):
Displaying 16 items.
- Drawing colored graphs with constrained vertex positions and few bends per edge (Q973017) (← links)
- Upward straight-line embeddings of directed graphs into point sets (Q1037786) (← links)
- Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
- NodeTrix planarity testing with small clusters (Q2319629) (← links)
- Recognizing DAGs with page-number 2 is NP-complete (Q2682927) (← links)
- On the Page Number of Upward Planar Directed Acyclic Graphs (Q3223971) (← links)
- Upward Partitioned Book Embeddings (Q4625113) (← links)
- Experimental Evaluation of Book Drawing Algorithms (Q4625114) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs (Q5387755) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5918733) (← links)
- 2-colored point-set embeddings of partial 2-trees (Q5925531) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5925712) (← links)
- A Sublinear Bound on the Page Number of Upward Planar Graphs (Q6057803) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- $st$-Orientations with Few Transitive Edges (Q6141787) (← links)
