Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Interval graphs and proper interval graphs in fuzzy and neutrosophic graphs
T Fujita, F Smarandache - Information Sciences with …, 2025 - sciencesforce.com
Interval graphs represent vertices as intervals on the real line, with edges denoting
overlap** intervals, while proper interval graphs prevent one interval from being fully …
overlap** intervals, while proper interval graphs prevent one interval from being fully …
[HTML][HTML] On blockers and transversals of maximum independent sets in co-comparability graphs
F Lucke, B Ries - Discrete Applied Mathematics, 2024 - Elsevier
In this paper, we consider the following two problems:(i) Deletion Blocker (α) where we are
given an undirected graph G=(V, E) and two integers k, d≥ 1 and ask whether there exists a …
given an undirected graph G=(V, E) and two integers k, d≥ 1 and ask whether there exists a …
The Complexity of Blocking All Solutions
C Grüne, L Wulf - arxiv preprint arxiv:2502.05348, 2025 - arxiv.org
We consider the general problem of blocking all solutions of some given combinatorial
problem with only few elements. For example, the problem of destroying all maximum …
problem with only few elements. For example, the problem of destroying all maximum …
A large and natural Class of - and -complete Problems in Bilevel and Robust Optimization
C Grüne, L Wulf - arxiv preprint arxiv:2311.10540, 2023 - arxiv.org
Because $\Sigma^ p_2 $-and $\Sigma^ p_3 $-hardness proofs are usually tedious and
difficult, not so many complete problems for these classes are known. This is especially true …
difficult, not so many complete problems for these classes are known. This is especially true …