On the complexity of stable hypergraph matching, stable multicommodity flow and related problems

Gergely Csáji. On the complexity of stable hypergraph matching, stable multicommodity flow and related problems. Theoretical Computer Science, 931:1-16, 2022. [doi]

@article{Csaji22,
  title = {On the complexity of stable hypergraph matching, stable multicommodity flow and related problems},
  author = {Gergely Csáji},
  year = {2022},
  doi = {10.1016/j.tcs.2022.07.025},
  url = {https://doi.org/10.1016/j.tcs.2022.07.025},
  researchr = {https://researchr.org/publication/Csaji22},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {931},
  pages = {1-16},
}