6 citations · 9 across the 6 of their papers we have counts for
7 papers
Solutions of partition function-based TU games for cooperative communication networking
Giovanni Rossi
In networked communications nodes choose among available actions and benefit from exchanging information through edges, while continuous technological progress fosters system funct…
Searching for network modules
Giovanni Rossi
When analyzing complex networks a key target is to uncover their modular structure, which means searching for a family of modules, namely node subsets spanning each a subnetwork mo…
The geometric lattice of embedded subsets
Giovanni Rossi
This work proposes an alternative approach to the so-called lattice of embedded subsets, which is included in the product of the subset and partition lattices of a finite set, and…
Multilinear objective function-based clustering
Giovanni Rossi
The input of most clustering algorithms is a symmetric matrix quantifying similarity within data pairs. Such a matrix is here turned into a quadratic set function measuring cluster…
Continuous set packing and near-Boolean functions
Giovanni Rossi
Given a family of feasible subsets of a ground set, the packing problem is to find a largest subfamily of pairwise disjoint family members. Non-approximability renders heuristics a…
Weighted paths between partitions
Giovanni Rossi
How to quantify the distance between any two partitions of a finite set is an important issue in statistical classification, whenever different clustering results need to be compar…