Highlight
Free Access

Fig. 3

thumbnail

Sketch of a bipartite graph. The bipartite graph contains two sets of nodes, X =  { x1,...,xN }  and C =  { c1,...,cK } . Edges connect nodes from different sets only and are weighted by an adjacency matrix B. Not all edges are shown.

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.