counterfeit
发表于 2025-3-21 17:19:27
书目名称Combinatorics, Algorithms, Probabilistic and Experimental Methodologies影响因子(影响力)<br> http://impactfactor.cn/2024/if/?ISSN=BK0230059<br><br> <br><br>书目名称Combinatorics, Algorithms, Probabilistic and Experimental Methodologies影响因子(影响力)学科排名<br> http://impactfactor.cn/2024/ifr/?ISSN=BK0230059<br><br> <br><br>书目名称Combinatorics, Algorithms, Probabilistic and Experimental Methodologies网络公开度<br> http://impactfactor.cn/2024/at/?ISSN=BK0230059<br><br> <br><br>书目名称Combinatorics, Algorithms, Probabilistic and Experimental Methodologies网络公开度学科排名<br> http://impactfactor.cn/2024/atr/?ISSN=BK0230059<br><br> <br><br>书目名称Combinatorics, Algorithms, Probabilistic and Experimental Methodologies被引频次<br> http://impactfactor.cn/2024/tc/?ISSN=BK0230059<br><br> <br><br>书目名称Combinatorics, Algorithms, Probabilistic and Experimental Methodologies被引频次学科排名<br> http://impactfactor.cn/2024/tcr/?ISSN=BK0230059<br><br> <br><br>书目名称Combinatorics, Algorithms, Probabilistic and Experimental Methodologies年度引用<br> http://impactfactor.cn/2024/ii/?ISSN=BK0230059<br><br> <br><br>书目名称Combinatorics, Algorithms, Probabilistic and Experimental Methodologies年度引用学科排名<br> http://impactfactor.cn/2024/iir/?ISSN=BK0230059<br><br> <br><br>书目名称Combinatorics, Algorithms, Probabilistic and Experimental Methodologies读者反馈<br> http://impactfactor.cn/2024/5y/?ISSN=BK0230059<br><br> <br><br>书目名称Combinatorics, Algorithms, Probabilistic and Experimental Methodologies读者反馈学科排名<br> http://impactfactor.cn/2024/5yr/?ISSN=BK0230059<br><br> <br><br>
Gentry
发表于 2025-3-21 21:08:41
http://reply.papertrans.cn/24/2301/230059/230059_2.png
金盘是高原
发表于 2025-3-22 04:22:20
http://reply.papertrans.cn/24/2301/230059/230059_3.png
主动
发表于 2025-3-22 05:26:48
http://reply.papertrans.cn/24/2301/230059/230059_4.png
ATRIA
发表于 2025-3-22 10:57:05
http://reply.papertrans.cn/24/2301/230059/230059_5.png
alcohol-abuse
发表于 2025-3-22 13:41:18
An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning,t bipartitioning problem is a fundamental graph partitioning problem and is NP-Complete. In this paper, we present an effective multi-level refinement algorithm based on swarm intelligence for bisecting graph. The success of our algorithm relies on exploiting both the swarm intelligence theory with
alcohol-abuse
发表于 2025-3-22 17:57:28
On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems,ths to connect all the source-sink pairs with minimized total length, while the Min-Max Disjoint Paths problem asks also . disjoint paths to connect all source-sink pairs but with minimized length of the longest path. In this paper we show that the weighted Min-Sum Disjoint Paths problem is ..-compl
Minuet
发表于 2025-3-22 23:40:46
A Digital Watermarking Scheme Based on Singular Value Decomposition,hemes which are based on SVD (Singular Value Decomposition) are being developed in some literatures nowadays. All of these SVD-based watermarking schemes have good embedding quality and high robustness, but they must depend on an original image or store some extra tables to extract watermark
原始
发表于 2025-3-23 02:17:35
http://reply.papertrans.cn/24/2301/230059/230059_9.png
不满分子
发表于 2025-3-23 08:52:22
Clique-Transversal Sets in Cubic Graphs, the minimum cardinality of a clique-transversal set in .. In this paper we present an upper bound and a lower bound on ..(.) for cubic graphs, and characterize the extremal cubic graphs achieving the lower bound. In addition, we present a sharp upper bound on ..(.) for claw-free cubic graphs.