The search parameter s0(G) corresponds to the pathwidth of a graph G, and s∞(G) to its treewidth. Determining sq(G) is NP-complete for any fixed q≥0 in general graphs and s0(T) can be computed in linear time i
technique with a new deterministic graph sparsification algorithm derived from the seminal-nettheory, which is also of independent interest. As byproducts, our result deduces the first deterministic fault-tolerant approximate distance labeling scheme with a non-trivial performance guarantee and an improved...
In recognition of the complexity and elusiveness of population processes, mathematical demographer interested in both mortality models and population forecasts have recently started to move away from deterministic models. Indeed, uncertainty (often arising from heterogeneity within a population) is one of ...
We revisit thedeterministic graphical gamesof Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we allow arbitrary real payoffs but disallow moves of chance. We study the complexity of solving deterministic graphical gam...
If the complexity of an algorithm is expressed asO (p(n))wherep(n)is some polynomial ofn, then the algorithm is said to be a polynomial time algorithm. Generally, polynomial time algorithms are tractable. Any algorithm with a time complexity that cannot be bounded by such bound then this ...
We consider the Exact-Weight-H problem of finding a (not necessarily induced) subgraph H of weight 0 in an edge-weighted graph G. We show that for every H, the complexity of this problem is strongly related to that of the infamous k-Sum problem. In particular, we show that under the...
A minimum spanning tree algorithm with inverse-Ackermann type complexity A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is 0(m α(m, n)), where α is t... Chazelle,Bernard - 《Journal of the Acm》 被引量: 526发表: 200...
Why "Password must meet complexity requirements" can't disable via "gpmc.msc"? Why are OWNER/CREATOR Permissions entered this way? Why as an admin can I not install a .msi package on Windows Server 2008 R2? Why Computer Name is not the same as System Name? why does a machine name in...
4.1.1 Bounded search trees The most ubiquitous de-nondeterminization technique is the bounded search tree technique. We present it on one of the most extensively studied problems in parameterized algorithms and complexity: k-Vertex Cover. Instance: A graph G and a non-negative integer k. Paramete...
The main reason for this coupling is that the routing decisions will affect the intra-class interference of each output, which results in increased scheduling complexity and reduced feasibility space. Recently, many works in the literature have considered the joint design problem of routing and ...