Pages that link to "Item:Q2708043"
From MaRDI portal
The following pages link to Drawing directed acyclic graphs: an experimental study (Q2708043):
Displaying 12 items.
- Star-struck by fixed embeddings: modern crossing number heuristics (Q2151428) (← links)
- A natural quadratic approach to the generalized graph layering problem (Q2206884) (← links)
- L-Drawings of Directed Graphs (Q2794352) (← links)
- Upward planarity testing in practice: SAT formulations and comparative study (Q2828203) (← links)
- A Generalization of the Directed Graph Layering Problem (Q2961516) (← links)
- A Note on the Practicality of Maximal Planar Subgraph Algorithms (Q2961528) (← links)
- The Open Graph Archive: A Community-Driven Effort (Q3223978) (← links)
- An Experimental Study on Distance-Based Graph Drawing (Q3611854) (← links)
- DAG—a program that draws directed graphs (Q3811724) (← links)
- How to draw a directed graph (Q3985344) (← links)
- Using a Significant Spanning Tree to Draw a Directed Graph (Q5301439) (← links)
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics (Q5886037) (← links)