NodeTrix
From MaRDI portal
Software:31428
No author found.
Related Items (14)
Algorithms and Bounds for L-Drawings of Directed Graphs ⋮ A user study on hybrid graph visualizations ⋮ \((k,p)\)-planarity: a relaxation of hybrid planarity ⋮ Computing NodeTrix Representations of Clustered Graphs ⋮ OnGraX: A Web-Based System for the Collaborative Visual Analysis of Graphs ⋮ ChordLink: a new hybrid visualization model ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Simultaneous FPQ-ordering and hybrid planarity testing ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Computing k-modal embeddings of planar digraphs ⋮ Seriation and matrix reordering methods: An historical overview ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ NodeTrix planarity testing with small clusters ⋮ Beyond Clustered Planar Graphs
This page was built for software: NodeTrix
