3 citations · 5 across the 13 of their papers we have counts for
1 paper · 2 filters
Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani +2
We study the NodeTrix planarity testing problem for flat clustered graphs when the maximum size of each cluster is bounded by a constant k. We consider both the case when the sid…