Laurent Besacier. Fourier, HDR. Besacier imag. Collaborations internationales hors projets 8. Fourier Depuis Septembre
|Published (Last):||27 March 2015|
|PDF File Size:||19.65 Mb|
|ePub File Size:||6.40 Mb|
|Price:||Free* [*Free Regsitration Required]|
Toggle navigation. Have you forgotten your login? Journal articles. Matthieu Latapy 2 AuthorId : Author. Hide details. Abstract : We define a new graph operator, called the weak-factor graph, which comes from the context of complex network modelling. The weak-factor operator is close to the well-known clique-graph operator but it rather operates in terms of bicliques in a multipartite graph.
We address the problem of the termination of the series of graphs obtained by iteratively applying the weak-factor operator starting from a given input graph. As for the clique-graph operator, it turns out that some graphs give rise to series that do not terminate. Therefore, we design a slight variation of the weak-factor operator, called clean-factor, and prove that its associated series terminates for all input graphs.
In addition, we show that the multipartite graph on which the series terminates has a very nice combinatorial structure: we exhibit a bijection between its vertices and the chains of the inclusion order on the intersections of the maximal cliques of the input graph.
Domain : Computer Science [cs]. On the termination of some biclique operators on multipartite graphs. Discrete Applied Mathematics , Elsevier, , , pp. Metrics Record views. Contact support.