Pages that link to "Item:Q4018851"
From MaRDI portal
The following pages link to Comparing Queues and Stacks As Machines for Laying Out Graphs (Q4018851):
Displayed 9 items.
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- Queue layouts of iterated line directed graphs (Q885285) (← links)
- A new upper bound on the queuenumber of hypercubes (Q965977) (← links)
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes (Q990104) (← links)
- Processor-efficient sparse matrix-vector multiplication (Q1767967) (← links)
- Computing straight-line 3D grid drawings of graphs in linear volume (Q2387202) (← links)
- Upward three-dimensional grid drawings of graphs (Q2503149) (← links)
- Characterizations of Deque and Queue Graphs (Q3104763) (← links)
- (3,2)-Track Layout of Bipartite Graph Subdivisions (Q5302747) (← links)