Algorithms and complexity of strongly stable non-crossing matchings
Year: 2025
Type: article
Source: Discrete Applied Mathematics
Authors: Sachin, B.S. Panda
Institution: Indian Institute of Technology Delhi
Language: English
Subfield: Economics and Econometrics
Domain: Social Sciences
Open Access status: closed
OpenAlex ID: W4415727347