图的NodeTrix表示的计算
Computing NodeTrix Representations of Clustered Graphs
摘要：
NodeTrix表示是可视化聚类图的一种流行方式;它们将聚类表示为邻接矩阵，将聚类间边缘表示为连接矩阵边界的曲线。我们研究了构建NodeTrix表示的复杂性，重点是平面性测试问题，我们展示了几个NP完全性结果和一些多项式时间算法。建立在这样的算法，我们开发了一个JavaScript库NodeTrix表示，旨在减少事件到同一矩阵的边缘之间的交叉。
英文摘要：
NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and inter-cluster edges as curves connecting the matrix boundaries. We study the complexity of constructing NodeTrix representations focusing on planarity testing problems, and we show several NP-completeness results and some polynomial-time algorithms. Building on such algorithms we develop a JavaScript library for NodeTrix representations aimed at reducing the crossings between edges incident to the same matrix.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
