ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2005.02218
  4. Cited By
On Reachable Assignments in Cycles and Cliques

On Reachable Assignments in Cycles and Cliques

5 May 2020
Luis Müller
M. Bentert
ArXiv (abs)PDFHTML

Papers citing "On Reachable Assignments in Cycles and Cliques"

1 / 1 papers shown
Title
Object Reachability via Swaps under Strict and Weak Preferences
Object Reachability via Swaps under Strict and Weak Preferences
Sen Huang
Mingyu Xiao
29
9
0
17 Sep 2019
1