On the Complexity of Minimum Maximal Acyclic Matchings

Juhi Chaudhary, Sounaka Mishra, B. S. Panda 0001. On the Complexity of Minimum Maximal Acyclic Matchings. In Yong Zhang 0001, Dongjing Miao, Rolf H. Möhring, editors, Computing and Combinatorics - 28th International Conference, COCOON 2022, Shenzhen, China, October 22-24, 2022, Proceedings. Volume 13595 of Lecture Notes in Computer Science, pages 106-117, Springer, 2022. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.