Improving crossings of inter-cluster edges

[ugurdogrusoz]

One particular improvement here might be using the cosep algorithm (instead of cose) for laying out the quotient graph. Here we need to carefully position circle nodes and set the port constraints accordingly though. Let's discuss.

[ugurdogrusoz]

Let's compare this version of CoSEP with the previous one using the provided graphs (privately) on the Google drive folder.

[herencalik]

• We integrated CoSEP algorithm instead of CoSE for laying out the quotient graph.
• Tested and compared both algorithms in two ways:
  1. Edge-Edge crossings in just after the quotient graph layout and
  2. Edge-Edge crossings in the final layout.
• CoSEP algorithm gives better results in the first case, whereas CoSE generally outperforms in the second case.
  The reason for this might be that we give many constraints while laying out the quotient graph and CoSEP lays the graph out trying to satisfy all the constraints, which produces a better layout in the quotient layout step but removes the freedom and randomness that might be useful in further steps. Also, CoSEP is not very good at the case where all the edges have absolute port constraints in both sides. If that is improved, CiSE case might also be reconsidered.

[ugurdogrusoz]

We give up on this idea (at least for now).