Nodetrix Planarity

Computing k-Modal Embeddings of Planar Digraphs

Given a planar digraph $G$ and a positive even integer $k$, an embedding of $G$ in the plane is _$k$-modal_, if every vertex of $G$ is incident to at most $k$ pairs of consecutive edges with opposite orientations, i.e., the incoming and the outgoing …

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 …