Pages that link to "Item:Q4268810"
From MaRDI portal
The following pages link to Stack and Queue Layouts of Directed Acyclic Graphs: Part II (Q4268810):
Displaying 27 items.
- On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs (Q260059) (← links)
- Graph layouts via layered separators (Q473100) (← links)
- Queue layouts of iterated line directed graphs (Q885285) (← links)
- Characterization of unlabeled level planar trees (Q924090) (← links)
- Volume requirements of 3D upward drawings (Q1011762) (← links)
- Processor-efficient sparse matrix-vector multiplication (Q1767967) (← links)
- On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees (Q2105426) (← links)
- On the complexity of recognizing Wheeler graphs (Q2118211) (← links)
- Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
- Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees (Q2279409) (← links)
- Enumeration of BC-subtrees of trees (Q2344772) (← links)
- Upward three-dimensional grid drawings of graphs (Q2503149) (← links)
- Recognizing DAGs with page-number 2 is NP-complete (Q2682927) (← links)
- Lazy queue layouts of posets (Q2701382) (← links)
- Characterizations of Deque and Queue Graphs (Q3104763) (← links)
- On the Page Number of Upward Planar Directed Acyclic Graphs (Q3223971) (← links)
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)
- Upward Partitioned Book Embeddings (Q4625113) (← links)
- Lazy Queue Layouts of Posets (Q5014104) (← links)
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs (Q5075794) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs (Q5387755) (← links)
- On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees (Q5737898) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5918733) (← 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)
