Search Results - "Exact Exponential Algorithms"

Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover by Akiba, Takuya, Iwata, Yoichi

“…We investigate the gap between theory and practice for exact branching algorithms. In theory, branch-and-reduce algorithms currently have the best time…”
Get full text

Quantum algorithms for one-sided crossing minimization by Caroppo, Susanna, Da Lozzo, Giordano, Di Battista, Giuseppe

“…We present singly-exponential quantum algorithms for the One-Sided Crossing Minimization (OSCM) problem. Given an n-vertex bipartite graph G=(U,V,E⊆U×V), a…”
Get full text

Exact algorithms for restricted subset feedback vertex set in chordal and split graphs by Bai, Tian, Xiao, Mingyu

Get full text

Exact and Approximate Digraph Bandwidth by Jain, Pallavi, Kanesh, Lawqueen, Lochet, Willian, Saurabh, Saket, Sharma, Roohani

“…In this paper, we introduce a directed variant of the classical Bandwidth problem and study it from the view-point of moderately exponential time algorithms,…”
Get full text

Enumerating minimal connected dominating sets in graphs of bounded chordality by Golovach, Petr A., Heggernes, Pinar, Kratsch, Dieter

“…Enumerating objects of specified type is one of the principal tasks in algorithmics. In graph algorithms one often enumerates vertex subsets satisfying a…”
Get full text

Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas by Subramani, K., Wojciechowski, Piotr

“…In this paper, we discuss algorithms for the problem of finding read-once resolution refutations of unsatisfiable 2CNF formulas within the resolution…”
Get full text

Exact exponential algorithms to find tropical connected sets of minimum size by Chapelle, Mathieu, Cochefert, Manfred, Kratsch, Dieter, Letourneur, Romain, Liedloff, Mathieu

“…Tropical Connected Set is strongly related to the Graph Motif problem which deals with vertex-colored graphs. Graph Motif has various applications in biology…”
Get full text

Counting Subgraphs via Homomorphisms by Amini, Omid, Fomin, Fedor V., Saurabh, Saket

“…We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach…”
Get full text

Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility by Calamoneri, Tiziana, Gastaldello, Mattia, Mary, Arnaud, Sagot, Marie-France, Sinaimeri, Blerina

“…Cytoplasmic incompatibility (CI) relates to the manipulation by the parasite Wolbachia of its host reproduction. Despite its widespread occurrence, the…”
Get full text

Efficient algorithms for the max  $$k$$ -vertex cover problem by Della Croce, Federico, Paschos, Vangelis Th

“…Given a graph G(V,E) of order n and a constant k⩽n , the max k -vertex cover problem consists of determining k vertices that cover the maximum number of edges…”
Get full text

Enumerating Minimal Subset Feedback Vertex Sets by Fomin, Fedor V., Heggernes, Pinar, Kratsch, Dieter, Papadopoulos, Charis, Villanger, Yngve

Get full text

An improved exact algorithm for undirected feedback vertex set by Xiao, Mingyu, Nagamochi, Hiroshi

“…A feedback vertex set in an undirected graph is a subset of vertices removal of which leaves a graph with no cycles. Razgon (in: Proceedings of the 10th…”
Get full text

MP or not MP: that is the question by Della Croce, Federico

“…It is well known that in the twentieth century, mathematical programming (MP) modeling and particularly linear programming (LP) modeling, even though strongly…”
Get full text

Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 by Razgon, Igor

“…In this paper we propose an O ( 1.0892 n ) algorithm solving the Maximum Independent Set problem for graphs with maximum degree 3 improving the previously best…”
Get full text

Computing hypergraph width measures exactly by Moll, Lukas, Tazari, Siamak, Thurley, Marc

“…Hypergraph width measures are important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm…”
Get full text

Bicolored independent sets and bicliques by Couturier, Jean-François, Kratsch, Dieter

“…We introduce the decision problem Bicolored Independent Set which generalizes the well-known NP-complete graph problem Independent Set. We present an…”
Get full text

Efficient algorithms for the max -vertex cover problem by Della Croce, Federico, Paschos, Vangelis Th

“…Given a graph  of order  and a constant , the max   -vertex cover problem consists of determining  vertices that cover the maximum number of edges in  . In its…”
Get full text

Branch and Recharge: Exact Algorithms for Generalized Domination by Fomin, Fedor V., Golovach, Petr A., Kratochvíl, Jan, Kratsch, Dieter, Liedloff, Mathieu

“…In this paper we present branching algorithms for infinite classes of problems. The novelty in the design and analysis of our branching algorithms lies in the…”
Get full text

Computing rank-width exactly by Oum, Sang-il

“…We prove that the rank-width of an n-vertex graph can be computed exactly in time O ( 2 n n 3 log 2 n log log n ) . To improve over a trivial O ( 3 n log n )…”
Get full text

Structural parameterizations of budgeted graph coloring by Bandopadhyay, Susobhan, Banerjee, Suman, Banik, Aritra, Raman, Venkatesh

“…We introduce a variant of the graph coloring problem, which we denote as Budgeted Coloring Problem (BCP). Given a graph G, an integer c and an ordered list of…”
Get full text