Suchergebnisse - "parameterized complexity"

On the complexity of list H-packing for sparse graph classes von Gima, Tatsuya, Hanaka, Tesshu, Kobayashi, Yasuaki, Otachi, Yota, Shirai, Tomohito, Suzuki, Akira, Tamura, Yuma, Zhou, Xiao

“… The problem of packing as many subgraphs isomorphic to some H∈H as possible into a graph, where H is a collection of graphs, has been well studied in the …”
Volltext

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges von Binucci, Carla, Liotta, Giuseppe, Montecchiani, Fabrizio, Ortali, Giacomo, Piselli, Tommaso

“… Orienting the edges of an undirected graph such that the resulting digraph satisfies some given constraints is a classical problem in graph theory, with …”
Volltext

On budget-constrained coverage in Multi-Interface networks: Branchwidth and treewidth perspectives von Aloisio, Alessandro, Navarra, Alfredo

“… Multi-Interface networks concern to achieve efficient communications while managing heterogeneous devices. The requirement to establish connections may occur …”
Volltext

The influence of dimensions on the complexity of computing decision trees von Kobourov, Stephen, Löffler, Maarten, Montecchiani, Fabrizio, Pilipczuk, Marcin, Rutter, Ignaz, Seidel, Raimund, Sorge, Manuel, Wulms, Jules

“… A decision tree recursively splits a feature space Rd and then assigns class labels based on the resulting partition. Decision trees have been part of the …”
Volltext

Further parameterized algorithms for the F -free edge deletion problem von Gaikwad, Ajinkya, Maity, Soumen

Volltext

Parameterized algorithms for locating-dominating sets von Cappelle, Márcia R., Gomes, Guilherme C.M, Santos, Vinicius F. dos

“… A locating-dominating set D of a graph G is a dominating set of G where each vertex not in D has a unique neighborhood in D, and the Locating-Dominating Set …”
Volltext

Smaller kernels for 3-leaf power modifications problems von Tsur, Dekel

“… A graph G is a 3-leaf power if there is a tree T and a bijective mapping f from V(G) to the set of leaves of T such that (u,v)∈E(G) if and only if the distance …”
Volltext

On the structural parameterized complexity of defective coloring von Bhyravarapu, Sriram, Kumar, Pankaj, Saurabh, Saket

“… In this paper, we consider the problem Defective Coloring. Given a graph G and two positive integers k and Δ⁎, the objective is to determine whether it is …”
Volltext

Parameterized complexity of broadcasting in graphs von Fomin, Fedor V., Fraigniaud, Pierre, Golovach, Petr A.

“… The task of the broadcast problem is, given a graph G and a source vertex s, to compute the minimum number of rounds required to disseminate a piece of …”
Volltext

Correcting a Graph Into a Linegraph Minimizing Hamming Distance Edition Is NP-Complete and FPT by Treewidth von Barth, Dominique, Watel, Dimitri, Weisser, Marc-Antoine

“… Since Beineke's work in 1968 on linegraphs, attention has focused on the classification of graphs as linegraphs. It is known that every graph $G$ is the …”
Volltext

A near-optimal kernel for a coloring problem von Haviv, Ishay, Rabinovich, Dror

“… For a fixed integer q, the q− Coloring problem asks to decide if a given graph has a vertex coloring with q colors such that no two adjacent vertices receive …”
Volltext

Parameterized complexity of envy-free resource allocation in social networks von Eiben, Eduard, Ganian, Robert, Hamm, Thekla, Ordyniak, Sebastian

“… We consider the classical problem of allocating indivisible resources among agents in an envy-free (and, where applicable, proportional) way. Recently, the …”
Volltext

Parameterized complexity of locally minimal defensive alliances von Gaikwad, Ajinkya, Maity, Soumen, Tripathi, Shuvam Kant

“… A set S of vertices of a graph is a defensive alliance if, for each element of S, the majority of its neighbours is in S. We consider the notion of local …”
Volltext

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms von Feldmann, Andreas Emil, Karthik C. S., Karthik C., Lee, Euiwoong, Manurangsi, Pasin

“… Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many …”
Volltext

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern von Focke, Jacob, Hörsch, Florian, Li, Shaohua, Marx, Dániel

“… The Multicut problem asks for a minimum cut separating certain pairs of vertices: formally, given a graph G and a demand graph H on a set $$T\subseteq V(G)$$ T …”
Volltext

On the complexity of temporal arborescence reconfiguration von Dondi, Riccardo, Lafond, Manuel

“… In this contribution we study the Arborescence Reconfiguration on temporal digraphs (Temporal Arborescence Reconfiguration). The problem, given two temporal …”
Volltext

Parameterized complexity of weighted target set selection von Suzuki, Takahiro, Kimura, Kei, Suzuki, Akira, Tamura, Yuma, Zhou, Xiao

“… Consider a graph G where each vertex has a threshold. A vertex v in G is activated if the number of active vertices adjacent to v is at least as many as its …”
Volltext

A quasi-quadratic vertex-kernel for Cograph Edge Editing von Crespelle, Christophe, Pellerin, Rémi, Thomassé, Stéphan

“… We provide a O(k2logk) vertex kernel for cograph edge editing. This improves a cubic kernel found by Guillemot, Havet, Paul and Perez (Guillemot et al., 2010) …”
Volltext

Finding a minimum spanning tree with a small non-terminal set von Hanaka, Tesshu, Kobayashi, Yasuaki

“… In this paper, we study the problem of finding a minimum weight spanning tree that contains each vertex in a given subset VNT of vertices as an internal …”
Volltext

On the complexity of solution extension of optimization problems von Casel, Katrin, Fernau, Henning, Khosravian Ghadikolaei, Mehdi, Monnot, Jérôme, Sikora, Florian

“… •Extending a partial solution of an optimization problem occurs as a subproblem in many areas.•We propose a general framework for dealing with these extension …”
Volltext