A new NP-hard problem, L-agony, ranks nodes via a binary label tree that explains the hierarchy, and a greedy divide-and-conquer heuristic is shown to recover ground-truth rankings in synthetic and real networks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Node ranking in labeled networks
A new NP-hard problem, L-agony, ranks nodes via a binary label tree that explains the hierarchy, and a greedy divide-and-conquer heuristic is shown to recover ground-truth rankings in synthetic and real networks.