Pages that link to "Item:Q2492625"
From MaRDI portal
The following pages link to Straight-line drawing algorithms for hierarchical graphs and clustered graphs (Q2492625):
Displaying 30 items.
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- Straight-line rectangular drawings of clustered graphs (Q629827) (← links)
- Drawing \(c\)-planar biconnected clustered graphs (Q885287) (← links)
- ILIGRA: an efficient inverse line graph algorithm (Q894425) (← links)
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis (Q903597) (← links)
- Characterization of unlabeled level planar trees (Q924090) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- Convex drawings of hierarchical planar graphs and clustered planar graphs (Q988690) (← links)
- How to draw a clustered tree (Q1044037) (← links)
- Clustered planarity = flat clustered planarity (Q1725728) (← links)
- Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996) (← links)
- Towards area requirements for drawing hierarchically planar graphs (Q1870562) (← links)
- On the computational complexity of edge concentration (Q1975372) (← links)
- Homotopy height, grid-major height and graph-drawing height (Q2206879) (← links)
- Advancements on SEFE and partitioned book embedding problems (Q2339452) (← links)
- Completely connected clustered graphs (Q2458931) (← links)
- The importance of being proper (Q2512653) (← links)
- Drawing Planar Graphs with Many Collinear Vertices (Q2961512) (← links)
- Ideal Drawings of Rooted Trees With Approximately Optimal Width (Q2985123) (← links)
- Hanani-Tutte and Monotone Drawings (Q3104784) (← links)
- Straight-Line Rectangular Drawings of Clustered Graphs (Q3183438) (← links)
- Straight-Line Drawability of a Planar Graph Plus an Edge (Q3449828) (← links)
- Clustered Planarity: Clusters with Few Outgoing Edges (Q3611843) (← links)
- Graph Simultaneous Embedding Tool, GraphSET (Q3611850) (← links)
- Algorithms for Cluster Busting in Anchored Graph Drawing (Q4386509) (← links)
- (Q4431088) (← links)
- Drawing Clustered Graphs on an Orthogonal Grid (Q4504998) (← links)
- Towards a Characterization of Stretchable Aligned Graphs (Q5014124) (← links)
- Drawing Halin-graphs with small height (Q5050008) (← links)
- Drawing Clustered Planar Graphs on Disk Arrangements (Q5216285) (← links)
