Výsledky vyhľadávania - Theoretical computer science; Algorithms and complexity

Eternal connected vertex cover problem in graphs: Complexity and algorithms Autor Paul, Kaustav, Pandey, Arti

“…This paper deals with a dynamic variant of vertex cover problem, known as the eternal vertex cover problem. This is a two-player (attacker and defender) game,…”
Získať plný text

From black-box complexity to designing new genetic algorithms Autor Doerr, Benjamin, Doerr, Carola, Ebel, Franziska

“…Black-box complexity theory recently produced several surprisingly fast black-box optimization algorithms…”
Získať plný text

Fragile complexity of adaptive algorithms Autor Bose, Prosenjit, Cano, Pilar, Fagerberg, Rolf, Iacono, John, Jacob, Riko, Langerman, Stefan

“…The fragile complexity of a comparison-based algorithm is f(n) if each input element participates in O(f(n)) comparisons…”
Získať plný text

Advice complexity of adaptive priority algorithms Autor Boyar, Joan, Larsen, Kim S., Pankratov, Denis

Získať plný text

MUL-tree pruning for consistency and optimal reconciliation - complexity and algorithms Autor Gascon, Mathieu, Dondi, Riccardo, El-Mabrouk, Nadia

“…A multi-labeled tree (or MUL-tree) is a rooted tree in which every leaf is labeled by an element from some set X, but in which more than one leaf may be…”
Získať plný text

Exact square coloring of certain classes of graphs: Complexity and algorithms Autor Priyamvada, Panda, B.S.

“… However, we give linear time algorithms for computing the exact square chromatic number of proper interval graphs and threshold…”
Získať plný text

Drawing graphs with k vertices per face: Complexity and algorithms Autor Bekos, Michael A., Di Battista, Giuseppe, Di Giacomo, Emilio, Didimo, Walter, Kaufmann, Michael, Montecchiani, Fabrizio

“… In this paper, we investigate the complexity of recognizing k+-real face graphs, that is, the complexity of testing whether a given graph is k+…”
Získať plný text

On the probe problem for (r,ℓ)-well-coveredness: Algorithms and complexity Autor Faria, Luerbio, Souza, Uéverton S.

“…•A graph G is well-covered if every maximal independent set is also maximum.•In this paper, we study the complexity of the Unpartitioned Probe problem for the class…”
Získať plný text

Algorithms and complexity for geodetic sets on partial grids Autor Chakraborty, Dibyayan, Gahlawat, Harmender, Roy, Bodhayan

“…A set S of vertices of a graph G is a geodetic set if every vertex of G lies in a shortest path between some pair of vertices of S. The Minimum Geodetic Set…”
Získať plný text

Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity Autor Amanatidis, Georgios, Fusco, Federico, Lazos, Philip, Leonardi, Stefano, Marchetti-Spaccamela, Alberto, Reiffenhäuser, Rebecca

“… For the latter, an important measure is the adaptive complexity, which captures the number of sequential rounds of parallel computation needed by an algorithm to terminate…”
Získať plný text

Multicommodity flows over time: Efficient algorithms and complexity Autor Hall, Alex, Hippler, Steffen, Skutella, Martin

“…’ are known to be NP-hard, the complexity of (fractional) ‘multicommodity flows over time’ has been open for many years…”
Získať plný text

Complexity of a root clustering algorithm for holomorphic functions Autor Batra, Prashant, Sharma, Vikram

“… Most algorithms in the literature for solving this problem are conditional, i.e., they make some simplifying assumptions, such as, all the roots are simple or there are…”
Získať plný text

Improved time complexity analysis of the Simple Genetic Algorithm Autor Oliveto, Pietro S., Witt, Carsten

“…A runtime analysis of the Simple Genetic Algorithm (SGA) for the OneMax problem has recently been presented proving that the algorithm with population size μ≤n1/8−ε…”
Získať plný text

Complexity and algorithms for constant diameter augmentation problems Autor Kim, Eun Jung, Milanič, Martin, Monnot, Jérôme, Picouleau, Christophe

“…?•We determine the computational complexity of this and related problems for different values of d…”
Získať plný text

Algorithms and complexity of graph convexity partizan games Autor Araújo, Samuel N., Brito, João Marcos, Folz, Raquel, de Freitas, Rosiane, Sampaio, Rudini M.

“… In this paper, we introduce the partizan variants of these impartial games on the geodesic convexity and extend them to other graph convexities, obtaining winning strategies and complexity results…”
Získať plný text

On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms Autor Conte, Alessio, Tomita, Etsuji

“…=NP. We revisit the maximal clique enumeration algorithm cliques by Tomita et al. that appeared in Theoretical Computer Science in 2006…”
Získať plný text

Complexity and algorithms for injective edge coloring of graphs Autor Priyamvada, Panda, B.S.

“…An injective k-edge-coloring of a graph G=(V,E) is an assignment ω:E→{1,2,…,k} of colors to the edges of G such that any two edges e and f receive distinct…”
Získať plný text

Complexity and algorithms for constant diameter augmentation problems Autor Kim, Eun Jung, Milanic, Martin, Monnot, Jérôme, Picouleau, Christophe

“… ? We determine the computational complexity of this and related problems for different values of $d$…”
Získať plný text

Complexity and parameterized algorithms for Cograph Editing Autor Liu, Yunlong, Wang, Jianxin, Guo, Jiong, Chen, Jianer

“… The computational complexity of this problem was open in the past. In this paper, we first show that this problem is NP-hard by a reduction from Exact 3-Cover…”
Získať plný text

Complexity and algorithms for neighbor-sum-2-distinguishing {1,3}-edge-weighting of graphs Autor Panda, B.S., Priyamvada

“…A neighbor-sum-distinguishing W-edge-weighting of a graph G=(V,E) is an assignment ω of weights from a set of integers W to the set of edges E of G such that…”
Získať plný text