NodeTrix
From MaRDI portal
Software:31428
swMATH19602MaRDI QIDQ31428FDOQ31428
Author name not available (Why is that?)
Cited In (14)
- Computing k-modal embeddings of planar digraphs
- Computing NodeTrix representations of clustered graphs
- ChordLink: a new hybrid visualization model
- Algorithms and bounds for L-drawings of directed graphs
- NodeTrix planarity testing with small clusters
- OnGraX: a web-based system for the collaborative visual analysis of graphs
- Beyond Clustered Planar Graphs
- 2-colored point-set embeddings of partial 2-trees
- Simultaneous FPQ-ordering and hybrid planarity testing
- A user study on hybrid graph visualizations
- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- \((k,p)\)-planarity: a relaxation of hybrid planarity
- Seriation and matrix reordering methods: An historical overview
- Parameterized complexity of graph planarity with restricted cyclic orders
This page was built for software: NodeTrix
