压榨机
发表于 2025-3-21 16:34:39
书目名称Parameterized and Exact Computation影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0741156<br><br> <br><br>书目名称Parameterized and Exact Computation影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0741156<br><br> <br><br>书目名称Parameterized and Exact Computation网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0741156<br><br> <br><br>书目名称Parameterized and Exact Computation网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0741156<br><br> <br><br>书目名称Parameterized and Exact Computation被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0741156<br><br> <br><br>书目名称Parameterized and Exact Computation被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0741156<br><br> <br><br>书目名称Parameterized and Exact Computation年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0741156<br><br> <br><br>书目名称Parameterized and Exact Computation年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0741156<br><br> <br><br>书目名称Parameterized and Exact Computation读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0741156<br><br> <br><br>书目名称Parameterized and Exact Computation读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0741156<br><br> <br><br>
责问
发表于 2025-3-21 20:29:07
Finding Good Decompositions for Dynamic Programming on Dense Graphs,mming by tree-width, at least for graphs of edge density above a certain bound. In view of the amount of previous work on heuristics for tree-width these results indicate that boolean-width could in the future outperform tree-width in practice for a large class of graphs and problems.
伪证
发表于 2025-3-22 03:28:35
http://reply.papertrans.cn/75/7412/741156/741156_3.png
ostracize
发表于 2025-3-22 07:51:21
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal,ement for the treewidth . graphs is necessary. Further lower bounds are given for parameterization by distance from cluster and co-cluster graphs respectively, as well as for . OCT parameterized by the vertex cover number (i.e., the distance from an independent set).
artifice
发表于 2025-3-22 11:40:57
On Multiway Cut Parameterized above Lower Bounds,hem to be fixed-parameter tractable. Our results imply ..(4.) algorithms for .. and . as well as an ..(2.) algorithm for .. with a standard parameterization by the solution size, improving previous bounds for these problems.
Insul岛
发表于 2025-3-22 15:58:31
http://reply.papertrans.cn/75/7412/741156/741156_6.png
安心地散步
发表于 2025-3-22 20:59:54
A Faster Algorithm for Dominating Set Analyzed by the Potential Method, analysis concentrates on one branching at once by using only small number of variables. In this paper, we extend the measure and conquer analysis and introduce a new analyzing technique named “potential method” to deal with consecutive branchings together. In potential method, the optimization prob
孵卵器
发表于 2025-3-22 23:37:53
http://reply.papertrans.cn/75/7412/741156/741156_8.png
出价
发表于 2025-3-23 03:46:09
Increasing the Minimum Degree of a Graph by Contractions, following three results. First, . is .-complete even when . = 14. Second, it is fixed-parameter tractable when parameterized by . and .. Third, it is .-hard when parameterized by .. We also study its variant where the input graph is weighted, i.e., has some edge weighting and the contractions pr
身体萌芽
发表于 2025-3-23 06:39:00
Planar Disjoint-Paths Completion,blem can be stated as follows: given a plane graph ., . pairs of terminals, and a face . of ., find a minimum-size set of edges, if one exists, to be added inside . so that the embedding remains planar and the pairs become connected by . disjoint paths in the augmented network. Our results are twofo