Results 31 to 40 of about 2,051,541 (361)
New Algorithms for Mixed Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions.
Louis Dublois +2 more
doaj +1 more source
Parameterized Proof Complexity [PDF]
computational complexity, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dantchev, S., Martin, B., Szeider, S.
openaire +2 more sources
On the Parameterized Complexity of Polytree Learning [PDF]
International Joint Conference on Artificial Intelligence, 2021 A Bayesian network is a directed acyclic graph that represents statistical dependencies between variables of a joint probability distribution. A fundamental task in data science is to learn a Bayesian network from observed data.
Niels Grüttemeier +2 more
semanticscholar +1 more source
Parameterized Complexity of Small Decision Tree Learning
AAAI Conference on Artificial Intelligence, 2021 We study the NP-hard problem of learning a decision tree (DT) of smallest depth or size from data. We provide the first parameterized complexity analysis of the problem and draw a detailed parameterized complexity map for the natural parameters: size or ...
S. Ordyniak, Stefan Szeider
semanticscholar +1 more source
Parameterized complexity of synchronization and road coloring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Automata, Logic and ...
Vojtěch Vorel, Adam Roman
doaj +1 more source
Clique Transversal Variants on Graphs: A Parameterized-Complexity Perspective
Mathematics, 2023 The clique transversal problem and its variants have garnered significant attention in the last two decades due to their practical applications in communication networks, social-network theory and transceiver placement for cellular telephones.
Chuan-Min Lee
doaj +1 more source
Algorithms, 2020 In this paper, we study the relationship of parameterized enumeration complexity classes defined by Creignou et al. (MFCS 2013). Specifically, we introduce two hierarchies (IncFPTa and CapIncFPTa) of enumeration complexity classes for incremental fpt ...
Arne Meier
doaj +1 more source
On the Descriptive Complexity of Color Coding
Algorithms, 2021 Color coding is an algorithmic technique used in parameterized complexity theory to detect “small” structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color ...
Max Bannach, Till Tantau
doaj +1 more source
The Parameterized Complexity of Connected Fair Division
International Joint Conference on Artificial Intelligence, 2021 We study the Connected Fair Division problem (CFD), which generalizes the fundamental problem of fairly allocating resources to agents by requiring that the items allocated to each agent form a connected subgraph in a provided item graph G.
Argyrios Deligkas +4 more
semanticscholar +1 more source
An analysis of the parameterized complexity of periodic timetabling
Journal of Scheduling, 2022 Public transportation networks are typically operated with a periodic timetable. The periodic event scheduling problem (PESP) is the standard mathematical modeling tool for periodic timetabling.
Niels Lindner, Julian Reisch
semanticscholar +1 more source