Search Results - "Exact exponential-time algorithm"

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

“…The Power Dominating Set problem is an extension of the well-known domination problem on graphs in a way that we enrich it by a second propagation rule: given…”
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

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

“…Arc Kayles and Colored Arc Kayles are generalized versions of well-studied combinatorial games Cram and Domineering, respectively. In Arc Kayles, two players…”
Get full text

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

“…Given a directed graph G=(V,A), the Directed Maximum Leaf Spanning Tree problem asks to compute a directed spanning tree with as many leaves as possible. By…”
Get full text

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

“…Averaging time series under dynamic time warping is an important tool for improving nearest-neighbor classifiers and formulating centroid-based clustering. The…”
Get full text

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

“…Cram , Domineering , and Arc Kayles are well-studied combinatorial games. They are interpreted as edge-selecting-type games on graphs, and the selected edges…”
Get full text

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

“…Given a graph G=(V,E) and a set S⊆V, a set U⊆V is a subset feedback vertex set of (G,S) if no cycle in G[V∖U] contains a vertex of S. The Subset Feedback…”
Get full text

On Independent Sets and Bicliques in Graphs by Gaspers, Serge, Kratsch, Dieter, Liedloff, Mathieu

“… ) and show that the maximum number of maximal bicliques in a graph on n vertices is Θ(3 n /3 ). Our major contribution is an exact exponential-time algorithm…”
Get full text

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

“…Due to a large number of applications, bicliques of graphs have been widely considered in the literature. This paper focuses on non-induced bicliques. Given a…”
Get full text

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

“…Graph Coloring Problem, as one of the best known NP-complete problems, has been extensively studied by researchers in a wide range of fields, leading to many…”
Get full text

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. The hardness of polynomial-time…”
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

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

Evolution through segmental duplications and losses: a Super-Reconciliation approach by Delabre, Mattéo, El-Mabrouk, Nadia, Huber, Katharina T., Lafond, Manuel, Moulton, Vincent, Noutahi, Emmanuel, Castellanos, Miguel Sautie

“…The classical gene and species tree reconciliation, used to infer the history of gene gain and loss explaining the evolution of gene families, assumes an…”
Get full text

Matching Cut in Graphs with Large Minimum Degree by Chen, Chi-Yeh, Hsieh, Sun-Yuan, Le, Hoang-Oanh, Le, Van Bang, Peng, Sheng-Lung

“…In a graph, a matching cut is an edge cut that is a matching. M atching C ut is the problem of deciding whether or not a given graph has a matching cut, which…”
Get full text

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

“…Many optimization problems can be phrased in terms of constraint satisfaction. In particular MAX-2-SAT and MAX-2-CSP are known to generalize many hard…”
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

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…”
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

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

“…We consider the -hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian…”
Get full text