Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Quantum-inspired perfect matching under vertex-color constraints
We propose and study the graph-theoretical problem EXISTS-PMVC: the existence of
perfect matching under vertex-color constraints on graphs with bi-colored edges. EXISTS …
perfect matching under vertex-color constraints on graphs with bi-colored edges. EXISTS …
The 2-Attractor Problem Is NP-Complete
J Fuchs, P Whittington - arxiv preprint arxiv:2304.06523, 2023 - arxiv.org
A $ k $-attractor is a combinatorial object unifying dictionary-based compression. It allows to
compare the repetitiveness measures of different dictionary compressors such as Lempel …
compare the repetitiveness measures of different dictionary compressors such as Lempel …
Multi‐budgeted matching problems
The multi‐budgeted matching problem (mBM) is a weighted matching problem with
independent edge cost functions. For each cost function, a budget constraint requires the …
independent edge cost functions. For each cost function, a budget constraint requires the …
Minimum color‐degree perfect b‐matchings
The minimum color‐degree perfect b‐matching problem (Col‐BM) is a new extension of the
perfect b‐matching problem to edge‐colored graphs. The objective of Col‐BM is to minimize …
perfect b‐matching problem to edge‐colored graphs. The objective of Col‐BM is to minimize …
[PDF][PDF] Minimum color-degree perfect b-matchings
MAC Büsing, M Comis, T Krabs - 2020 - publications.rwth-aachen.de
The minimum color-degree perfect b-matching problem (Col-BM) is a new extension of the
perfect b-matching problem to edge-colored graphs. The objective of Col-BM is to minimize …
perfect b-matching problem to edge-colored graphs. The objective of Col-BM is to minimize …
[IDÉZET][C] The 2-Attractor Problem Is NP-CompleteLIPIcs, Volume 289, STACS 2024Leibniz International Proceedings in Informatics (LIPIcs)
J Fuchs - 2024 - Deutsche Nationalbibliothek