Výsledky vyhledávání - "Exact Exponential Algorithm"

Structural parameterizations of budgeted graph coloring Autor 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…”
Získat plný text

On the complexity of and solutions to the minimum stopping and trapping set problems Autor Velasquez, Alvaro, Subramani, K., Wojciechowski, Piotr

“…In this paper, we discuss the problems of finding minimum stopping sets and trapping sets in Tanner graphs, using integer linear programming. These problems…”
Získat plný text

An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure Autor Xiao, Mingyu, Nagamochi, Hiroshi

“…The paper presents an O ∗ ( 1 . 2312 n ) -time and polynomial-space algorithm for the traveling salesman problem in an n -vertex graph with maximum degree 3…”
Získat plný text

On the complexity of computing treelength Autor Lokshtanov, Daniel

“…We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced…”
Získat plný text

On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms Autor Fomin, Fedor V., Gaspers, Serge, Pyatkin, Artem V., Razgon, Igor

“…We present a time algorithm finding a minimum feedback vertex set in an undirected graph on n vertices. We also prove that a graph on n vertices can contain at…”
Získat plný text

Computing Directed Pathwidth in O(1.89n) Time Autor Kitsunai, Kenta, Kobayashi, Yasuaki, Komuro, Keita, Tamaki, Hisao, Tano, Toshihiro

“…We give an algorithm for computing the directed pathwidth of a digraph with n vertices in O ( 1 . 89 n ) time. This is the first algorithm with running time…”
Získat plný text

Exact Algorithms for Treewidth and Minimum Fill-In Autor Fomin, Fedor V., Kratsch, Dieter, Todinca, Ioan, Villanger, Yngve

“…We show that the treewidth and the minimum fill-in of an $n$-vertex graph can be computed in time $\mathcal{O}(1.8899^n)$. Our results are based on…”
Získat plný text

An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4 Autor Xiao, Mingyu, Nagamochi, Hiroshi

“…The paper presents a 1.692 n n O (1) -time polynomial-space algorithm for the traveling salesman problem in an n -vertex edge-weighted graph with maximum…”
Získat plný text

Inclusion/Exclusion Meets Measure and Conquer Autor Nederlof, Jesper, van Rooij, Johan M. M., van Dijk, Thomas C.

“…Inclusion/exclusion and measure and conquer are two central techniques from the field of exact exponential-time algorithms that recently received a lot of…”
Získat plný text

Pathwidth of cubic graphs and exact algorithms Autor Fomin, Fedor V., Høie, Kjartan

“…We prove that for any ɛ > 0 there exists an integer n ɛ such that the pathwidth of every cubic (or 3-regular) graph on n > n ɛ vertices is at most ( 1 / 6 + ɛ…”
Získat plný text

Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover Autor 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…”
Získat plný text

Quantum algorithms for one-sided crossing minimization Autor 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…”
Získat plný text

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

Získat plný text

Exact and Approximate Digraph Bandwidth Autor 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,…”
Získat plný text

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

Získat plný text

Enumerating minimal connected dominating sets in graphs of bounded chordality Autor 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…”
Získat plný text

Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas Autor 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…”
Získat plný text

Exact exponential algorithms to find tropical connected sets of minimum size Autor 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…”
Získat plný text

Counting Subgraphs via Homomorphisms Autor 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…”
Získat plný text

Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility Autor 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…”
Získat plný text