Computing NodeTrix Representations of Clustered Graphs

摘要

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 pla-narity testing problems, and we show several NP-completeness results and some polynomial-time algorithms.