Defines graph partitioning problems to test ranking robustness for a subset under similarity constraints, proves mostly NP-hard, and solves special cases with real-world examples.
On rectangle intersection and overlap graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Ranking with Partitioning
Defines graph partitioning problems to test ranking robustness for a subset under similarity constraints, proves mostly NP-hard, and solves special cases with real-world examples.