Skip to search formSkip to main contentSkip to account menu

Kernelization

Known as: Kernel 
In computer science, a kernelization is a technique for designing efficient algorithms that achieve their efficiency by a preprocessing stage in… 
Wikipedia (opens in a new tab)

Related topics

Related topics

22 relations
AlgorithmAlgorithmic paradigmBidimensionalityBipartite dimension

Broader (1)

Analysis of algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Exploring the Kernelization Borders for Hitting Cycles
A generalization of classical cycle hitting problems, called conflict version of the problem, is defined as follows. An input is… 
Review
2015
Review
2015
Advanced kernelization algorithms
The systematic study of the kernelization framework, whose foretaste we had in Chapter 2 , revealed an intrinsic mathematical… 
2014
2014
Probabilistic Prototype Classification Using t-norms
We introduce a generalization of Multivariate Robust Soft Learning Vector Quantization. The approach is a probabilistic… 
2014
2014
Parameterized Algorithms for the Subgraph Isomorphism Problem
Given two undirected graphs F and G, the subgraph isomorphism problem asks whether there exists a subgraph of G that is… 
2013
2013
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II
2010
2010
Extended Islands of Tractability for Parsimony Haplotyping
Parsimony haplotyping is the problem of finding a smallest size set of haplotypes that can explain a given set of genotypes. The… 
2009
2009
Profile Based Cross-Document Coreference Using Kernelized Fuzzy Relational Clustering
Coreferencing entities across documents in a large corpus enables advanced document understanding tasks such as question… 
2007
2007
Directed Feedback Vertex Set Problem is FPT
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long standing open… 
2006
2006
The Computational Complexity of the Unrooted Subtree Prune and Regraft Distance
We show that computation of the subtree prune and regraft (SPR) distance between unrooted binary phylogenetic trees is NP-Hard… 
2006
2006
Surface Roughness Effects in Low Reynolds Number Channel Flows
Abstract : Rarefied helium and nitrogen flow expanding into vacuum through 150 micrometers high and 1.5 cm long channels is… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)