Sort and Search: exact algorithms for generalized domination
type: Item
instance of: scholarly article
title: Sort and Search: exact algorithms for generalized domination
zbMATH Open document ID: 1197.05104
author: Fedor V. Fomin
author: Petr A. Golovach
author: Jan Kratochvíl
author: Dieter Kratsch
author: Mathieu Liedloff
published in: Information Processing Letters
publication date: 2010-08-20T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5773800
zbMATH Keywords: sorting
zbMATH Keywords: searching
zbMATH Keywords: exact algorithms
zbMATH Keywords: domination
zbMATH Keywords: graph algorithms
Wikidata QID: Q60488704
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.03.023
OpenAlex ID: W2052354073
cites work: Algorithms for four variants of the exact satisfiability problem
cites work: Q4393480
cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory
cites work: MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS
cites work: Q4368728
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: Q4369384
cites work: A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
cites work: Q4414647
DBLP publication ID: journals/ipl/FominGKKL09
DOI: 10.1016/J.IPL.2009.03.023
description: scientific article; zbMATH DE number 5773800