Pages that link to "Item:Q1337400"
From MaRDI portal
The following pages link to Algorithms for drawing graphs: An annotated bibliography (Q1337400):
Displaying 50 items.
- Bend-optimal orthogonal drawings of triconnected plane graphs (Q1713568) (← links)
- Modifying orthogonal drawings for label placement (Q1736777) (← links)
- Fixed edge-length graph drawing is NP-hard (Q1813977) (← links)
- An algorithm for drawing general undirected graphs (Q1822997) (← links)
- Bipolar orientations revisited (Q1842650) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- Two-dimensional packing algorithms for layout of disconnected graphs (Q1857089) (← links)
- Graph multidimensional scaling with self-organizing maps (Q1857090) (← links)
- Optimizing area and aspect ratio in straight-line orthogonal tree drawings (Q1862119) (← links)
- On embedding an outer-planar graph in a point set (Q1862133) (← links)
- Towards area requirements for drawing hierarchically planar graphs (Q1870562) (← links)
- Proximity drawings in polynomial area and volume (Q1882852) (← links)
- Upward planarity testing (Q1904391) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- Characterizing proximity trees (Q1920422) (← links)
- On the computational complexity of edge concentration (Q1975372) (← links)
- Testing gap \(k\)-planarity is NP-complete (Q2032139) (← links)
- Some two-vertex resistances of nested triangle network (Q2118706) (← links)
- The slotted online one-sided crossing minimization problem on 2-regular graphs (Q2169959) (← links)
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout (Q2201764) (← links)
- Independent sets in Line of Sight networks (Q2201775) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- Visualizing SAT instances and runs of the DPLL algorithm (Q2462641) (← links)
- A framework and algorithms for circular drawings of graphs (Q2465996) (← links)
- Triangulating with high connectivity. (Q2482884) (← links)
- An experimental comparison of four graph drawing algorithms. (Q2482890) (← links)
- An analysis of some linear graph layout heuristics (Q2491338) (← links)
- Algorithms for drawing binary trees in the plane. (Q2583549) (← links)
- Drawing directed acyclic graphs: an experimental study (Q2708043) (← links)
- (Q2728899) (← links)
- Equilateral drawing of 2-connected planar chordal graphs (Q2741352) (← links)
- Automatic layout of statecharts (Q2783199) (← links)
- Recurrence-based time series analysis by means of complex network methods (Q2915477) (← links)
- Optimal Embedding of Locally Twisted Cubes into Grids (Q2971629) (← links)
- Finding Large Independent Sets in Line of Sight Networks (Q2971663) (← links)
- Algorithms for Cluster Busting in Anchored Graph Drawing (Q4386509) (← links)
- Evolutionary graph drawing algorithms (Q4454480) (← links)
- Drawing graphs with attribute graph grammars (Q4645294) (← links)
- Experimental studies on graph drawing algorithms (Q4789076) (← links)
- A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT (Q4818541) (← links)
- HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs (Q5014108) (← links)
- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching (Q5054813) (← links)
- Computing proximity drawings of trees in the 3-dimensional space (Q5057437) (← links)
- Connecting the dots (with minimum crossings) (Q5088932) (← links)
- Nearest neighbour graph realizability is NP-hard (Q5096336) (← links)
- On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem (Q5096926) (← 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)
- A Linear-Time Algorithm for Finding Induced Planar Subgraphs (Q5140735) (← links)
- PLANARITY TESTING AND CONSTRUCTING THE TOPOLOGICAL DRAWING OF A PLANE GRAPH (DFS) (Q5150740) (← links)
