Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
7538645 | Social Networks | 2015 | 8 Pages |
Abstract
We also consider the situation when two individuals u and v are connected if and only if their preferences are not antithetical, that is, if and only if au·avâ¥0, and the situation when two individuals u and v are connected if and only if their preferences are neither antithetical nor “orthogonal”, that is, if and only if au·av>0. For these two cases we prove that the diversity problem is polynomial-time solvable for any fixed d and that the clustering problem is polynomial-time solvable for d â¤Â 3.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Statistics and Probability
Authors
Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen,