Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables

Gregory Gutin; Leo van Iersel; Matthias Mnich; Anders Yeo

doi:10.1016/j.jcss.2011.01.004

ScienceGate Book Chapters

JOURNAL ARTICLE

Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables

Gregory Gutin Leo van Iersel Matthias Mnich Anders Yeo

Year: 2011 Journal: Journal of Computer and System Sciences Vol: 78 (1)Pages: 151-163 Publisher: Elsevier BV

DOI: 10.1016/j.jcss.2011.01.004

Get Full-Text PDF Get Analytical Report

Keywords:

Multiset Mathematics Permutation (music) Parameterized complexity Combinatorics Ternary operation Kernel (algebra) Cyclic permutation Discrete mathematics Permutation group Set (abstract data type) Symmetric group Computer science

Metrics

Cited By

5.11

FWCI (Field Weighted Citation Impact)

Refs

0.96

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables

Metrics

Citation History

Topics

Related Documents

All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables

Kernelization, Constraint Satisfaction Problems Parameterized above Average

Kernelization: Constraint Satisfaction Problems Parameterized Above Average

Improved Parameterized Algorithms for above Average Constraint Satisfaction

Kernelization, Permutation CSPs Parameterized above Average