Kernelization: Constraint Satisfaction Problems Parameterized Above Average

Gregory Gutin

doi:10.1007/978-3-642-27848-8_524-1

ScienceGate Book Chapters

BOOK-CHAPTER

Kernelization: Constraint Satisfaction Problems Parameterized Above Average

Gregory Gutin

Year: 2014 Encyclopedia of Algorithms Pages: 1-4

DOI: 10.1007/978-3-642-27848-8_524-1

Get Full-Text PDF Get Analytical Report

Keywords:

Kernelization Parameterized complexity Constraint (computer-aided design) Constraint satisfaction dual problem Computer science Constraint satisfaction problem Mathematics Local consistency Artificial intelligence Algorithm

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.50

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Constraint Satisfaction and Optimization

Physical Sciences → Computer Science → Computer Networks and Communications

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Kernelization: Constraint Satisfaction Problems Parameterized Above Average

Metrics

Topics

Related Documents

Kernelization, Constraint Satisfaction Problems Parameterized above Average

Kernelization, Permutation CSPs Parameterized above Average

Kernelization, Permutation CSPs Parameterized above Average

Improved Parameterized Algorithms for above Average Constraint Satisfaction

Kernelization, MaxLin Above Average