Densest Subgraph (twice)
Name: Densest Subgraph (twice)
Symbol: $\mathrm{dens}^*$
Definition:The densest subgraph dimension of a concept class is equal to twice the density of the densest subgraph (a.k.a. subgraph density) of its $1$-inclusion graph.
The densest subgraph is dual to the lowest outdegree orientation.
Category: Graph-based
Symmetric: Yes
Monotonic: Yes
P-Monotonic: No
Doubly Monotonic: No
Strictly Monotonic: No
Values: None
Relationships (as Parameter 1):