Chylomicron
发表于 2025-3-21 19:35:29
书目名称Computing and Combinatorics影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0234776<br><br> <br><br>书目名称Computing and Combinatorics影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0234776<br><br> <br><br>书目名称Computing and Combinatorics网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0234776<br><br> <br><br>书目名称Computing and Combinatorics网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0234776<br><br> <br><br>书目名称Computing and Combinatorics被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0234776<br><br> <br><br>书目名称Computing and Combinatorics被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0234776<br><br> <br><br>书目名称Computing and Combinatorics年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0234776<br><br> <br><br>书目名称Computing and Combinatorics年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0234776<br><br> <br><br>书目名称Computing and Combinatorics读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0234776<br><br> <br><br>书目名称Computing and Combinatorics读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0234776<br><br> <br><br>
AWE
发表于 2025-3-21 21:44:38
http://reply.papertrans.cn/24/2348/234776/234776_2.png
POWER
发表于 2025-3-22 03:27:51
Speed Scaling for Maximum Lateness,teness. We consider two variants of the problem: In the . variant we aim in finding a schedule minimizing the maximum lateness for a given budget of energy, while in the . variant our objective is to find a schedule minimizing a linear combination of maximum lateness and energy. We present polynomia
Distribution
发表于 2025-3-22 05:12:52
Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?,ph. For instance, the larger the maximum independent set of the pattern graph is the more efficient algorithms are known. The situation seems to be substantially different in the case of induced subgraph isomorphism for pattern graphs of fixed size. We present two results which provide evidence that
Anterior
发表于 2025-3-22 12:26:08
Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs,ected planar graph with . vertices embedded in the plane. The algorithm takes .(.) time per sample, after an initial .(..) preprocessing time during which the algorithm computes the number of all such contiguous minimum cuts. Contiguous cuts (that is, cuts where a naturally defined boundary around t
小说
发表于 2025-3-22 13:37:53
http://reply.papertrans.cn/24/2348/234776/234776_6.png
小说
发表于 2025-3-22 18:39:26
http://reply.papertrans.cn/24/2348/234776/234776_7.png
pacific
发表于 2025-3-22 21:41:35
http://reply.papertrans.cn/24/2348/234776/234776_8.png
一小块
发表于 2025-3-23 03:25:39
An Improved Algorithm for Packing ,-Paths in Inner Eulerian Networks, we mean a simple directed path connecting distinct terminals with all intermediate nodes in . − .. This paper concerns the problem of finding a maximum .-path packing, i.e. a maximum collection of arc-disjoint .-paths..A min-max relation for this problem was established by Lomonosov. The capacitate
原始
发表于 2025-3-23 07:04:32
Towards Optimal and Expressive Kernelization for ,-Hitting Set,me data reduction for problems formalizable as .-., the problem of covering all hyperedges (of cardinality at most .) of a hypergraph by at most . vertices. Additionally, in fault diagnosis, sunflowers yield concise explanations for “highly defective structures”. We provide a linear-time algorithm t