The corresponding parameter is denoted by rsq and is shown to be equal to the non-deterministic graph searching parameter sq for q=0,1, and at most twice sq for any q≥2 (for any graph G). Our main result is a
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...
Polynomial and Non - polynomial time algorithm 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...
except that we allow arbitrary real payoffs but disallow moves of chance. We study the complexity of solving deterministic graphical games and obtain an almost-linear time comparison-based algorithm for computing an equilibrium
Instance: A graph G of pathwidth ≤l and a non-negative integer k. Parameter: k+l. Question: Does G have cutwidth at most k? An FPT-algorithm for pw-k-Cutwidth is based on the construction, for any k,l≥0, of a non-deterministic finite state automaton that receives G as a word...
A recursive, depth-first algorithm for AND-OR graph search Cyclic solution Cyclic solution:keep trying until it works. We can express this solution by adding a label to denote some portion of the plan and using the label later instead of repeating the plan itself. E.g.: [Suck, L1: Right...
M Thorup,DR Karger - Workshop on Algorithm Theory-swat 被引量: 30发表: 2008年 Dynamic graph algorithms with applications (invited talk) The application of MST for spanning tree packing is new and when boot-strapped, it yields a fully-dynamic polylogarithmic algorithm for approximating general ed...
We describe an algorithm that solves the first and second forms of the problem in O(n 2+∊ ) time for any constant ∊ > 0 where n is the number of edges of the terrain. This algorithm can be extended to compute a search structure for (3) in O(n 2+∊ ) time. The search ...
The graph of transducer A constructed by Algorithm 1 for the RE e of Eq. (3). The sets \(Ini _{AS }\) and \(Fol _{AS }\) used by the algorithm are taken from Table 2. Each arc carries an input symbol and the output produced, which is a set of 3-tuples, omitting for bre...
(2015). The SCCDDd algorithm takes the deterministic component of a data stream window to produce dendrograms, while CRCDDd constructs the CRP matrix only using this same deterministic influence. The motivation for using the deterministic component is because it contains temporal dependencies among ...