Recognizing graph supports for preference profiles under six traversal paradigms is NP-hard for bounded number of edges or maximum degree, except for polynomial-time cases like DFS on trees.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
When Graph Traversal Meets Structured Preferences: Unified Framework and Complexity Results
Recognizing graph supports for preference profiles under six traversal paradigms is NP-hard for bounded number of edges or maximum degree, except for polynomial-time cases like DFS on trees.