Pages that link to "Item:Q4652929"
From MaRDI portal
The following pages link to PATHWIDTH AND LAYERED DRAWINGS OF TREES (Q4652929):
Displaying 20 items.
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area (Q452455) (← links)
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs (Q629832) (← links)
- 2-connecting outerplanar graphs without blowing up the pathwidth (Q744095) (← links)
- On the stab number of rectangle intersection graphs (Q778517) (← links)
- Convergence of Newton's method over commutative semirings (Q899320) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Anagram-free graph colouring (Q1753108) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- Horton-Strahler number, rooted pathwidth and upward drawings of trees (Q2059912) (← links)
- Graph drawings with few slopes (Q2385698) (← links)
- \(k\)-spine, 1-bend planarity (Q2503294) (← links)
- Triangulating Planar Graphs While Keeping the Pathwidth Small (Q2827827) (← links)
- Minimum-Layer Drawings of Trees (Q3078403) (← links)
- PROXIMITY DRAWINGS OF HIGH-DEGREE TREES (Q3459369) (← links)
- Drawing Halin-graphs with small height (Q5050008) (← links)
- On Layered Fan-Planar Graph Drawings (Q5089175) (← links)
- Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width) (Q5208867) (← links)
- A Lower Bound on the Area Requirements of Series-Parallel Graphs (Q5302052) (← links)
- Drawing Planar Graphs with Reduced Height (Q5892364) (← links)
- 2-Layer Graph Drawings with Bounded Pathwidth (Q6181954) (← links)
