Wellcome to Maximimi's library,

  You can find here all papers liked or uploaded by Maximimi
  together with brief user bio and description of her/his academic activity.


Link to my homepage

I will read the following papers.

I read the following papers.

2019-2020

2018-2019:

2017-2018:

Comments:

Nice paper!

  • Publicly available implementation: https://gitlab.inria.fr/bora-ucar/karp--sipser-reduction
  • I like Theorem 3.1 a lot! I'm thinking how to generalize it, adapt it, use it for other problems.
  • Would have liked to see experiments on larger graphs.
  • Is there any other Rules that could be considered in addition to Rules 1 and 2?
Read the paper, add your comments…

Comments:

Nice paper along the work of Dasgupta and Cohen-Addad et al..

A function to quantify the quality of a hierarchical graph clustering / dendrogram is proposed.

An interesting application to compress a dendrogram is proposed.

Section 8. If the input graph is a complete bipartite graph, then the quality function Q is maximum if the graph is partitioned in the two independent sets.

Read the paper, add your comments…

Comments:

Read the paper, add your comments…
Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32