Diversity curves track the spread of graphs across edge-contraction coarsening levels to produce interpretable, size-aware graph representations with claimed higher expressivity than standard structural descriptors.
Leinster.Entropy and Diversity: The Axiomatic Approach
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
Maximum Solow-Polasky diversity subset selection of fixed size is NP-hard for Euclidean point sets in the plane.
Maximizing Solow-Polasky diversity for a fixed-cardinality subset is NP-hard in general metric spaces.
citing papers explorer
-
Diversity Curves for Graph Representation Learning
Diversity curves track the spread of graphs across edge-contraction coarsening levels to produce interpretable, size-aware graph representations with claimed higher expressivity than standard structural descriptors.
-
Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
Maximum Solow-Polasky diversity subset selection of fixed size is NP-hard for Euclidean point sets in the plane.
-
Selecting a Maximum Solow-Polasky Diversity Subset in General Metric Spaces Is NP-hard
Maximizing Solow-Polasky diversity for a fixed-cardinality subset is NP-hard in general metric spaces.