Pages that link to "Item:Q2959747"
From MaRDI portal
The following pages link to Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments (Q2959747):
Displaying 10 items.
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs (Q476437) (← links)
- Drawing plane triangulations with few segments (Q1622344) (← links)
- Intersections and circuits in sets of line segments (Q2084612) (← links)
- Minimum-segment convex drawings of 3-connected cubic plane graphs (Q2377378) (← links)
- On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs (Q2936956) (← links)
- On self-approaching and increasing-chord drawings of 3-connected planar graphs (Q2970443) (← links)
- Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments (Q2985120) (← links)
- (Q3369055) (← links)
- Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs (Q4265499) (← links)
- Drawing Planar Graphs with Few Geometric Primitives (Q4585062) (← links)