Pages that link to "Item:Q2482890"
From MaRDI portal
The following pages link to An experimental comparison of four graph drawing algorithms. (Q2482890):
Displayed 20 items.
- Maximum upward planar subgraphs of embedded planar digraphs (Q945947) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- New results on drawing angle graphs (Q1384188) (← links)
- A better heuristic for orthogonal graph drawings (Q1384200) (← links)
- An optimal layout of multigrid networks (Q1607012) (← links)
- Algorithms for the fixed linear crossing number problem (Q1613416) (← links)
- Algorithms for the multiple label placement problem (Q2432730) (← links)
- A framework and algorithms for circular drawings of graphs (Q2465996) (← links)
- Graph layering by promotion of nodes (Q2489908) (← links)
- Orthogonal drawings of graphs with vertex and edge labels (Q2573336) (← links)
- DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY (Q2708043) (← links)
- A New Approach to Exact Crossing Minimization (Q3541091) (← links)
- Computing Maximum C-Planar Subgraphs (Q3611845) (← links)
- (Q4789076) (← links)
- Drawing database schemas (Q4791031) (← links)
- A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT (Q4818541) (← links)
- Algorithms for the Hypergraph and the Minor Crossing Number Problems (Q5387756) (← links)
- Efficient Extraction of Multiple Kuratowski Subdivisions (Q5452219) (← links)