Designable target graphs plus stable-partition bundles yield poly-time pairwise-stable seating, team, and b-matching arrangements, with hardness when the graph is given.
Title resolution pending
1 Pith paper cite this work, alongside 41 external citations. Polarity classification is still indexing.
1
Pith paper citing it
41
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Designing Pairwise-Stable Agent Seating Arrangements
Designable target graphs plus stable-partition bundles yield poly-time pairwise-stable seating, team, and b-matching arrangements, with hardness when the graph is given.