On directed covering and domination problems
type: Item
instance of: scholarly article
title: On directed covering and domination problems
zbMATH Open document ID: 1407.05194
author: Tesshu Hanaka
author: N. Nishimura
author: Hirotaka Ono
published in: Discrete Applied Mathematics
publication date: 2019-03-28T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8246/
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 7044573
zbMATH Keywords: directed graph
zbMATH Keywords: vertex cover
zbMATH Keywords: dominating set
zbMATH Keywords: edge dominating set
zbMATH Keywords: fixed-parameter algorithms
MaRDI profile type: Publication
OpenAlex ID: W2908576804
cites work: The edge Hamiltonian path problem is NP-complete
cites work: The dag-width of directed graphs
cites work: On some properties of DNA graphs
cites work: Finding Hamiltonian circuits in quasi-adjoint graphs
cites work: A \(c^k n\) 5-approximation algorithm for treewidth
cites work: Nondeterminism within $P^ * $
cites work: Approximation hardness of dominating set problems in bounded degree graphs
cites work: Parameterized Algorithms
cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
cites work: Domination problems in nowhere-dense classes of graphs
cites work: Analytical approach to parallel repetition
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Q4850549
cites work: Kernelization and Sparseness: the case of Dominating Set
cites work: edge dominating set: Efficient Enumeration-Based Exact Algorithms
cites work: Parameterized complexity of coloring problems: treewidth versus vertex cover
cites work: Digraph width measures in parameterized algorithmics
cites work: Q4198056
cites work: Some properties of line digraphs
cites work: Directed tree-width
cites work: Treewidth. Computations and approximations
cites work: k-cyclic Orientations of Graphs
cites work: Q5743498
cites work: Planar Formulae and Their Uses
cites work: Face covers and the genus problem for apex graphs
cites work: Edge Dominating Sets in Graphs
Wikidata QID: Q128580590
DOI: 10.1016/J.DAM.2018.12.012
description: scientific article; zbMATH DE number 7044573