Search Results - Exact exponential-time algorithm

Semi-Exact Exponential-Time Algorithms: an Experimental Study by El-Wahab, Mohamed Mahmoud Abd, Abu-Khzam, Faisal N., Wang, Kai, Shaw, Peter

“…The last decade witnessed an increased interest in exact and parameterized exponential-time algorithms for NP - hard problems…”
Get full text

An Exact Exponential Time Algorithm for Power Dominating Set by Binkele-Raible, Daniel, Fernau, Henning

“… We show that Power Dominating Set remains -hard on cubic graphs. We design an algorithm solving this problem in time on general graphs, using polynomial space…”
Get full text

An exact exponential time algorithm for counting bipartite cliques by Kutzkov, Konstantin

“… ► Exact exponential time algorithm for counting bipartite cliques. ► A new simplification rule for handling degree-1 vertices. ► Measure & Conquer analysis…”
Get full text

Exact exponential-time algorithms for finding bicliques by Binkele-Raible, Daniel, Fernau, Henning, Gaspers, Serge, Liedloff, Mathieu

“… ( 1.6914 n ) -time algorithm for this problem. It is based on an algorithm for bipartite graphs that runs in time O ( 1.30052 n…”
Get full text

Faster winner determination algorithms for (Colored) Arc Kayles by Hanaka, Tesshu, Kiya, Hironori, Lampis, Michael, Ono, Hirotaka, Yoshiwatari, Kanae

“…)-time algorithms are known, where n is the number…”
Get full text

An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem by Binkele-Raible, Daniel, Fernau, Henning

“… By designing a branching algorithm analyzed with Measure&Conquer, we show that the problem can be solved in time O⁎(1.9044n…”
Get full text

Exact algorithms for counting 3-colorings of graphs by Zhu, Enqiang, Wu, Pu, Shao, Zehui

“… In this paper, we focus on the design of exact algorithms for counting 3-colorings of a graph (denoted by #3-Coloring…”
Get full text

Exact mean computation in dynamic time warping spaces by Brill, Markus, Fluschnik, Till, Froese, Vincent, Jain, Brijnesh, Niedermeier, Rolf, Schultz, David

“… Then we propose an exponential-time dynamic program for computing a global minimum of the Fréchet function. The proposed algorithm is useful for benchmarking and evaluating known heuristics…”
Get full text

Winner Determination Algorithms for Graph Games with Matching Structures by Hanaka, Tesshu, Kiya, Hironori, Ono, Hirotaka, Yoshiwatari, Kanae

“… We first observe that the winner determination for Colored Arc Kayles can be done in O ∗ ( 2 n ) time by a simple algorithm, where n is the order of the input graph…”
Get full text

Faster exact algorithms for some terminal set problems by Chitnis, Rajesh, Fomin, Fedor V., Lokshtanov, Daniel, Misra, Pranabendu, Ramanujan, M.S., Saurabh, Saket

“… In this paper, we introduce a general method to obtain faster exact exponential time algorithms for several terminal set problems…”
Get full text

Moderate exponential-time algorithms for scheduling problems by T’kindt, Vincent, Della Croce, Federico, Liedloff, Mathieu

“…, exact algorithms whose worst-case time complexity is moderately exponential with respect to brute force algorithms…”
Get full text

New exact algorithms for the 2-constraint satisfaction problem by Golovnev, Alexander, Kutzkov, Konstantin

“… Algorithms solving the problem exactly have been designed but the running time is improved over trivial brute-force solutions only for very sparse instances…”
Get full text

On the Complexity of the Smallest Grammar Problem over Fixed Alphabets by Casel, Katrin, Fernau, Henning, Gaspers, Serge, Gras, Benjamin, Schmid, Markus L.

“…In the smallest grammar problem, we are given a word w and we want to compute a preferably small context-free grammar G for the singleton language { w } (where…”
Get full text

Moderate exponential-time algorithms for scheduling problems by T’kindt, Vincent, Della Croce, Federico, Liedloff, Mathieu

“…, exact algorithms whose worst-case time complexity is moderately exponential with respect to brute force algorithms…”
Get full text

Exact and Parameterized Algorithms for Max Internal Spanning Tree by Binkele-Raible, Daniel, Fernau, Henning, Gaspers, Serge, Liedloff, Mathieu

“… This problem is a generalization of the famous Hamiltonian Path problem. Our dynamic-programming algorithms for general and degree-bounded graphs have running times of the form with c ≤2…”
Get full text

Subset feedback vertex sets in chordal graphs by Golovach, Petr A., Heggernes, Pinar, Kratsch, Dieter, Saei, Reza

“… We give an algorithm with running time O(1.6708n) that enumerates all minimal subset feedback vertex sets on chordal graphs on n vertices…”
Get full text

Exponential-time approximation of weighted set cover by Cygan, Marek, Kowalik, Łukasz, Wykurz, Mateusz

“… In recent years, many researchers design exact exponential-time algorithms for problems of that kind…”
Get full text

On Two Techniques of Combining Branching and Treewidth by Fomin, Fedor V., Gaspers, Serge, Saurabh, Saket, Stepanov, Alexey A.

“…Branch & Reduce and dynamic programming on graphs of bounded treewidth are among the most common and powerful techniques used in the design of moderately exponential time exact algorithms for NP hard problems…”
Get full text

Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds by Gupta, Sushmita, Raman, Venkatesh, Saurabh, Saket

“…We show that for a fixed $r$, the number of maximal $r$-regular induced subgraphs in any graph with $n$ vertices is upper bounded by $\mathcal{O}(c^n)$, where…”
Get full text

Stable Matching Games: Manipulation via Subgraph Isomorphism by Gupta, Sushmita, Roy, Sanjukta

“… (with complete preference lists) from the viewpoint of exact-exponential time algorithms. Specifically, we study the Stable Extension of Partial Matching ( SEOPM…”
Get full text