Results 11 to 20 of about 2,051,541 (361)
Parameterized Complexity of Broadcasting in Graphs [PDF]
Theoretical Computer Science, 2023 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 information from s to all vertices in the graph. It is assumed that, at each round, an informed vertex
F. Fomin, P. Fraigniaud, P. Golovach
semanticscholar +6 more sources
Parameterized Complexity Dichotomy for Steiner Multicut [PDF]
Journal of Computer and System Sciences, 2014 The Steiner Multicut problem asks, given an undirected graph G, terminals sets T1,...,Tt $\subseteq$ V(G) of size at most p, and an integer k, whether there is a set S of at most k edges or nodes s.t.
Bringmann, Karl +3 more
core +15 more sources
Parameterized Complexity of Graph Burning [PDF]
Algorithmica, 2020 Graph Burning asks, given a graph G=(V,E)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt ...
Yasuaki Kobayashi, Y. Otachi
semanticscholar +6 more sources
The Parameterized Complexity of Clustering Incomplete Data
AAAI Conference on Artificial Intelligence, 2021 We study fundamental clustering problems for incomplete data. Specifically, given a set of incomplete d-dimensional vectors (representing rows of a matrix), the goal is to complete the missing vector entries in a way that admits a partitioning of the ...
Eduard Eiben +4 more
openalex +3 more sources
Parameterized Complexity of Secluded Connectivity Problems [PDF]
, 2015 The Secluded Path problem models a situation where a sensitive information has to be transmitted between a pair of nodes along a path in a network. The measure of the quality of a selected path is its exposure, which is the total weight of vertices in ...
Fomin, Fedor V. +3 more
core +6 more sources
Parameterized Complexity of Safe Set [PDF]
Journal of Graph Algorithms and Applications, 2019 In this paper we study the problem of finding a small safe set S in a graph G, i.e. a non-empty set of vertices such that no connected component of G[S] is adjacent to a larger component in \(G - S\).
R. Belmonte +5 more
semanticscholar +4 more sources
Enhancing UAV Object Detection in Low-Light Conditions with ELS-YOLO: A Lightweight Model Based on Improved YOLOv11 [PDF]
SensorsDrone-view object detection models operating under low-light conditions face several challenges, such as object scale variations, high image noise, and limited computational resources.
Tianhang Weng, Xiaopeng Niu
doaj +2 more sources
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. [PDF]
AlgorithmicaBlažej V +3 more
europepmc +3 more sources
Parameterized Complexity of Directed Spanner Problems. [PDF]
Algorithmica, 2022 AbstractWe initiate the parameterized complexity study of minimum t-spanner problems on directed graphs. For a positive integer t, a multiplicative t-spanner of a (directed) graph G is a spanning subgraph H such that the distance between any two vertices in H is at most t times the distance between these vertices in G, that is, H keeps the distances in
Fomin FV +5 more
europepmc +12 more sources
Parameterized Complexity Classification for Interval Constraints [PDF]
International Symposium on Parameterized and Exact Computation, 2023 Constraint satisfaction problems form a nicely behaved class of problems that lends itself to complexity classification results. From the point of view of parameterized complexity, a natural task is to classify the parameterized complexity of MinCSP ...
Konrad K. Dabrowski +5 more
semanticscholar +1 more source