Pages that link to "Item:Q2491338"
From MaRDI portal
The following pages link to An analysis of some linear graph layout heuristics (Q2491338):
Displaying 8 items.
- Algorithms for the fixed linear crossing number problem (Q1613416) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)
- Crossing Minimisation Heuristics for 2-page Drawings (Q3439393) (← links)
- An analysis of heuristics for graph planarization (Q4354090) (← links)
- Experimental Evaluation of Book Drawing Algorithms (Q4625114) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- Parameterized algorithms for fixed-order book drawing with few crossings per edge (Q6569894) (← links)