Pages that link to "Item:Q2482890"

The following pages link to An experimental comparison of four graph drawing algorithms. (Q2482890):

Displaying 38 items.

• Relating bends and size in orthogonal graph drawings (Q293201) (← links)
• 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)
• 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
• Star-struck by fixed embeddings: modern crossing number heuristics (Q2151428) (← 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)
• Upward Planarity Testing in Practice (Q2828203) (← links)
• A Note on the Practicality of Maximal Planar Subgraph Algorithms (Q2961528) (← links)
• An effective crossing minimisation heuristic based on star insertion (Q3121515) (← links)
• Graph Compact Orthogonal Layout Algorithm (Q3195336) (← links)
• The Open Graph Archive: A Community-Driven Effort (Q3223978) (← links)
• A New Approach to Exact Crossing Minimization (Q3541091) (← links)
• Computing Maximum C-Planar Subgraphs (Q3611845) (← links)
• An Interactive Tool to Explore and Improve the Ply Number of Drawings (Q4625099) (← links)
• Experimental Analysis of the Accessibility of Drawings with Few Segments (Q4625100) (← links)
• (Q4789076) (← links)
• Drawing database schemas (Q4791031) (← links)
• A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT (Q4818541) (← links)
• Experimental Analysis of the Accessibility of Drawings with Few Segments (Q4961757) (← links)
• (Q5009576) (← links)
• Stronger ILPs for the Graph Genus Problem. (Q5075767) (← links)
• Computing orthogonal drawings with the minimum number of bends (Q5096950) (← links)
• Orthogonal drawing of high degree graphs with small area and few bends (Q5096952) (← links)
• Algorithms for the Hypergraph and the Minor Crossing Number Problems (Q5387756) (← links)
• Efficient Extraction of Multiple Kuratowski Subdivisions (Q5452219) (← links)
• Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics (Q5886037) (← links)
• Advances in the Planarization Method: Effective Multiple Edge Insertions (Q5895513) (← links)
• Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)