Pages that link to "Item:Q2961508"
From MaRDI portal
The following pages link to Computing NodeTrix Representations of Clustered Graphs (Q2961508):
Displaying 16 items.
- Clustered planarity = flat clustered planarity (Q1725728) (← links)
- Turning cliques into paths to achieve planarity (Q1725735) (← links)
- Simultaneous FPQ-ordering and hybrid planarity testing (Q2034412) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- A user study on hybrid graph visualizations (Q2151426) (← links)
- ChordLink: a new hybrid visualization model (Q2206859) (← links)
- NodeTrix planarity testing with small clusters (Q2319629) (← links)
- \((k,p)\)-planarity: a relaxation of hybrid planarity (Q2664946) (← links)
- Parameterized complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
- Computing NodeTrix Representations of Clustered Graphs (Q2961508) (← links)
- Algorithms and Bounds for L-Drawings of Directed Graphs (Q3177336) (← links)
- (Q4600741) (redirect page) (← links)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- Computing k-modal embeddings of planar digraphs (Q5075755) (← links)
- 2-colored point-set embeddings of partial 2-trees (Q5919105) (← links)
- 2-colored point-set embeddings of partial 2-trees (Q5925531) (← links)
