Results 11 to 20 of about 394,763 (294)
Lossy Kernelization for (Implicit) Hitting Set Problems [PDF]
Embedded Systems and Applications, 2023 We re-visit the complexity of kernelization for the $d$-Hitting Set problem. This is a classic problem in Parameterized Complexity, which encompasses several other of the most well-studied problems in this field, such as Vertex Cover, Feedback Vertex Set
F. Fomin +5 more
semanticscholar +1 more source
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion [PDF]
Symposium on the Theory of Computing, 2022 In the F-minor-free deletion problem we are given an undirected graph G and the goal is to find a minimum vertex set that intersects all minor models of graphs from the family F.
B. Jansen, Michał Włodarczyk
semanticscholar +1 more source
Kernelization for Graph Packing Problems via Rainbow Matching [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2022 We introduce a new kernelization tool, called rainbow matching technique}, that is appropriate for the design of polynomial kernels for packing problems and their hitting counterparts.
S. Bessy +3 more
semanticscholar +1 more source
Expansion Lemma—Variations and Applications to Polynomial-Time Preprocessing
Algorithms, 2023 In parameterized complexity, it is well-known that a parameterized problem is fixed-parameter tractable if and only if it has a kernel—an instance equivalent to the input instance, whose size is just a function of the parameter.
Ashwin Jacob +2 more
doaj +1 more source
Clique Search in Graphs of Special Class and Job Shop Scheduling
Mathematics, 2022 In this paper, we single out the following particular case of the clique search problem. The vertices of the given graph are legally colored with k colors and we are looking for a clique with k nodes in the graph.
Sándor Szabó, Bogdán Zaválnij
doaj +1 more source
Entropy, 2021 The pervasive presence of artificial intelligence (AI) in our everyday life has nourished the pursuit of explainable AI. Since the dawn of AI, logic has been widely used to express, in a human-friendly fashion, the internal process that led an (intelligent) system to deliver a specific output.
Mirko Polato, Fabio Aiolli
openaire +3 more sources
Journal of the ACM, 2009 In a parameterized problem, every instance I comes with a positive integer k . The problem is said to admit a polynomial kernel if, in polynomial time, one can reduce the size of the instance I to a polynomial in k while preserving the answer ...
Hans L. Bodlaender +5 more
openaire +8 more sources
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs [PDF]
Algorithmica, 2020 We study algorithmic properties of the graph class CHORDAL-ke\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength ...
F. Fomin, P. Golovach
semanticscholar +1 more source
Algorithms, 2020 This Special Issue contains eleven articles—surveys and research papers—that represent fresh and ambitious new directions in the area of Parameterized Complexity. They provide ground-breaking research at the frontiers of knowledge, and they contribute to
Neeldhara Misra +2 more
doaj +1 more source
Algorithms for comparing large pedigree graphs
Advances in Computing and Engineering, 2022 The importance of pedigrees is translated by geneticists as a tool for diagnosing genetic diseases. Errors resulting during collection of data and missing information of individuals are considered obstacles in deducing pedigrees, especially larger ones ...
Nahla A. Belal +2 more
doaj +1 more source