Finding forest-orderings of tournaments is NP-complete
[Submitted on 16 Feb 2024 (v1), last revised 17 Jul 2026 (this v
·
2024-02-17
·
via math.CO updates on arXiv.org
arXiv:2402.10782v4 Announce Type: replace Abstract: Given a class of (undirected) graphs $\mathcal{C}$, we sa…
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。