legerdemain
发表于 2025-3-21 17:14:30
书目名称Combinatorial Algorithms影响因子(影响力)<br> http://impactfactor.cn/2024/if/?ISSN=BK0229882<br><br> <br><br>书目名称Combinatorial Algorithms影响因子(影响力)学科排名<br> http://impactfactor.cn/2024/ifr/?ISSN=BK0229882<br><br> <br><br>书目名称Combinatorial Algorithms网络公开度<br> http://impactfactor.cn/2024/at/?ISSN=BK0229882<br><br> <br><br>书目名称Combinatorial Algorithms网络公开度学科排名<br> http://impactfactor.cn/2024/atr/?ISSN=BK0229882<br><br> <br><br>书目名称Combinatorial Algorithms被引频次<br> http://impactfactor.cn/2024/tc/?ISSN=BK0229882<br><br> <br><br>书目名称Combinatorial Algorithms被引频次学科排名<br> http://impactfactor.cn/2024/tcr/?ISSN=BK0229882<br><br> <br><br>书目名称Combinatorial Algorithms年度引用<br> http://impactfactor.cn/2024/ii/?ISSN=BK0229882<br><br> <br><br>书目名称Combinatorial Algorithms年度引用学科排名<br> http://impactfactor.cn/2024/iir/?ISSN=BK0229882<br><br> <br><br>书目名称Combinatorial Algorithms读者反馈<br> http://impactfactor.cn/2024/5y/?ISSN=BK0229882<br><br> <br><br>书目名称Combinatorial Algorithms读者反馈学科排名<br> http://impactfactor.cn/2024/5yr/?ISSN=BK0229882<br><br> <br><br>
forbid
发表于 2025-3-21 23:29:16
https://doi.org/10.1007/978-3-8350-5507-0 .. Roughly speaking, we show that the easy cases one can think of (. when edgeless graphs of the right sizes are in ., or if . contains only cliques) are the only families giving rise to a polynomial problem: all others are .-complete. We then investigate the parameterized complexity of the problem
对待
发表于 2025-3-22 03:58:42
http://reply.papertrans.cn/23/2299/229882/229882_3.png
FAZE
发表于 2025-3-22 06:26:54
Six Sigma Performance Measurement Systemonal complexity classification results of the compaction problem for such graphs determined earlier by the author. Our results show that the compaction, vertex-compaction, and retraction problems are polynomially equivalent for every graph with four or fewer vertices.
Ornament
发表于 2025-3-22 10:00:05
On the Parameterized Complexity of Happy Vertex Coloringtudy the problem . with a different parameterization, which we call .. The problem . takes as an input a graph ., integers . and ., a vertex subset ., and a coloring .. The goal is to decide if there exist a coloring . such that . and ., where . is the set of happy vertices in . with respect to .. W
caldron
发表于 2025-3-22 16:13:11
Complexity Dichotomies for the Minimum ,-Overlay Problem .. Roughly speaking, we show that the easy cases one can think of (. when edgeless graphs of the right sizes are in ., or if . contains only cliques) are the only families giving rise to a polynomial problem: all others are .-complete. We then investigate the parameterized complexity of the problem
caldron
发表于 2025-3-22 18:52:06
http://reply.papertrans.cn/23/2299/229882/229882_7.png
Iatrogenic
发表于 2025-3-23 00:13:35
http://reply.papertrans.cn/23/2299/229882/229882_8.png
玷污
发表于 2025-3-23 04:53:57
https://doi.org/10.1007/978-88-470-0700-0numeration of Skolem labellings and related structures. This includes discussion of two constructions of low density parity check codes from Skolem labellings. We raise several pertinent questions and suggestions for future research directions.
vitrectomy
发表于 2025-3-23 06:58:16
http://reply.papertrans.cn/23/2299/229882/229882_10.png