Pages that link to "Item:Q3402367"
From MaRDI portal
The following pages link to Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces (Q3402367):
Displayed 12 items.
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- Straight-line rectangular drawings of clustered graphs (Q629827) (← links)
- Clustered planarity testing revisited (Q895058) (← links)
- A new perspective on clustered planarity as a combinatorial embedding problem (Q897898) (← links)
- Clustered planarity = flat clustered planarity (Q1725728) (← links)
- Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- Relaxing the constraints of clustered planarity (Q2261574) (← links)
- Computing NodeTrix Representations of Clustered Graphs (Q2961508) (← links)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs (Q5384459) (← links)
- Multilevel Planarity (Q5856666) (← links)