Titlebook: Parameterized and Exact Computation; 6th International Sy Dániel Marx,Peter Rossmanith Conference proceedings 2012 Springer-Verlag GmbH Ber

壓榨機(jī)

書目名稱Parameterized and Exact Computation影響因子(影響力)




書目名稱Parameterized and Exact Computation影響因子(影響力)學(xué)科排名




書目名稱Parameterized and Exact Computation網(wǎng)絡(luò)公開度




書目名稱Parameterized and Exact Computation網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Parameterized and Exact Computation被引頻次




書目名稱Parameterized and Exact Computation被引頻次學(xué)科排名




書目名稱Parameterized and Exact Computation年度引用




書目名稱Parameterized and Exact Computation年度引用學(xué)科排名




書目名稱Parameterized and Exact Computation讀者反饋




書目名稱Parameterized and Exact Computation讀者反饋學(xué)科排名

責(zé)問(wèn)

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.

偽證

ostracize

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

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島

安心地散步

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

孵卵器

出價(jià)

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 .[1]-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

身體萌芽

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