Searching for "Generalizing the Motzkin-Straus Theorem to Edge-Weighted Graphs" – sorted by Relevance.
-
Dominant sets and pairwise clustering
- be considered as a step toward generalizing the Motzkin-Straus theorem to edge-weighted graphs (see [5] for a
- Cited by 1 (0 self) – Add To MetaCart

