Pages that link to "Item:Q1725757"
From MaRDI portal
The following pages link to A heuristic approach towards drawings of graphs with high crossing resolution (Q1725757):
Displaying 8 items.
- Crossing minimization in extended level drawings of graphs (Q968125) (← links)
- A force-directed algorithm that preserves edge-crossing properties (Q1607039) (← links)
- A greedy heuristic for crossing-angle maximization (Q1725762) (← links)
- Topology-Driven Force-Directed Algorithms (Q3073669) (← links)
- Angular Resolutions: Around Vertices and Crossings (Q5001662) (← links)
- Graph Drawing via Gradient Descent, $$(GD)^2$$ (Q5014098) (← links)
- (Q5075824) (← links)
- Graphs with large total angular resolution (Q5918989) (← links)