神像之光环
发表于 2025-3-21 16:09:49
书目名称Combinatorial Optimization and Applications影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0229970<br><br> <br><br>书目名称Combinatorial Optimization and Applications影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0229970<br><br> <br><br>书目名称Combinatorial Optimization and Applications网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0229970<br><br> <br><br>书目名称Combinatorial Optimization and Applications网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0229970<br><br> <br><br>书目名称Combinatorial Optimization and Applications被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0229970<br><br> <br><br>书目名称Combinatorial Optimization and Applications被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0229970<br><br> <br><br>书目名称Combinatorial Optimization and Applications年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0229970<br><br> <br><br>书目名称Combinatorial Optimization and Applications年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0229970<br><br> <br><br>书目名称Combinatorial Optimization and Applications读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0229970<br><br> <br><br>书目名称Combinatorial Optimization and Applications读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0229970<br><br> <br><br>
烦扰
发表于 2025-3-21 23:09:18
A Characterisation of Stable Sets in Games with Transitive Preference,This article characterises stable sets in an abstract game. We show that every stable subset of the pure strategies for the game is characterised as a fixed point of the mapping assigning to each upper boundedly preordered subset of the strategies the set of all its maximal elements.
parasite
发表于 2025-3-22 03:33:36
A Fast Algorithm for Powerful Alliances in Trees, vertex . at least half of the total weight in the closed neighborhood of . is contributed by the vertices of .. Finding the smallest such set in general graphs is NP-complete, even when the weights are all the same. In this paper, we give a linear time algorithm that finds the smallest global powerful alliance of any weighted tree . = (.,.).
发出眩目光芒
发表于 2025-3-22 07:06:41
Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering, for identifying conditionally correlated genes, combined with an efficient density based search for clustering sample sets. Experimental results on both synthetic and real datasets demonstrated that LinCoh consistently finds more accurate and higher quality bi-clusters than existing bi-clustering algorithms.
Intruder
发表于 2025-3-22 10:52:41
http://reply.papertrans.cn/23/2300/229970/229970_5.png
engrave
发表于 2025-3-22 13:40:45
http://reply.papertrans.cn/23/2300/229970/229970_6.png
engrave
发表于 2025-3-22 20:00:33
Cyclic Vertex Connectivity of Star Graphs,es. The cardinality of a minimum cyclic vertex-cut of ., denoted by ..(.), is the cyclic vertex-connectivity of .. In this paper, we show that for any integer . ≥ 4, the .-dimensional star graph .. has ..(..) = 6(. − 3).
浮夸
发表于 2025-3-22 21:18:56
The Number of Shortest Paths in the (,, ,)-Star Graphs,of . in terms of the transpositions corresponding to edges in that graph. This result generalizes a previous one for the star graph, and can be applied to obtain the number of the shortest paths between a pair of vertices in some of the other similar structures. It also implies an algorithm to enumerate all such paths.
意外的成功
发表于 2025-3-23 02:01:06
http://reply.papertrans.cn/23/2300/229970/229970_9.png
Adenoma
发表于 2025-3-23 08:34:41
Marc Joye,David Naccache,Stéphanie Porte vertex . at least half of the total weight in the closed neighborhood of . is contributed by the vertices of .. Finding the smallest such set in general graphs is NP-complete, even when the weights are all the same. In this paper, we give a linear time algorithm that finds the smallest global powerful alliance of any weighted tree . = (.,.).