On the parameterized complexity of the edge monitoring problem
type: Item
instance of: scholarly article
title: On the parameterized complexity of the edge monitoring problem
zbMATH Open document ID: 1404.68080
author: Julien Baste
author: Fairouz Beggas
author: H. Kheddouci
author: Ignasi Sau
published in: Information Processing Letters
publication date: 2017-02-21T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6687383
zbMATH Keywords: Edge Monitoring
zbMATH Keywords: parameterized complexity
zbMATH Keywords: FPT algorithm
zbMATH Keywords: bidimensionality theory
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2017.01.008
OpenAlex ID: W2583078788
cites work: Unit disk graphs
cites work: Fundamentals of parameterized complexity
cites work: Parametrized complexity theory.
cites work: Q5710169
cites work: Linearity of grid minors in treewidth with applications through bidimensionality
cites work: Q5501345
cites work: Mathematical Foundations of Computer Science 2004
cites work: Treewidth. Computations and approximations
cites work: The extremal function for complete minors
cites work: Contraction obstructions for treewidth
DOI: 10.1016/J.IPL.2017.01.008
description: scientific article; zbMATH DE number 6687383