Fixed-parameter complexity of minimum profile problems
type: Item
instance of: scholarly article
title: Fixed-parameter complexity of minimum profile problems
zbMATH Open document ID: 1170.68020
author: G. Gutin
author: Stefan Szeider
author: A. Yeo
published in: Algorithmica
publication date: 2008-12-02T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5377138
zbMATH Keywords: graph profile
zbMATH Keywords: fixed parameter tractability
zbMATH Keywords: above guaranteed value
zbMATH Keywords: kernel
MaRDI profile type: Publication
full work available at URL: s00453-007-9144-0
OpenAlex ID: W2120983666
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: On interval graphs and matrice profiles
cites work: Fixed-parameter tractability of graph modification problems for hereditary properties
cites work: Q4037408
cites work: Graph searching and interval completion
cites work: Q4198056
cites work: The linear arrangement problem parameterized above guaranteed value
cites work: Q3549635
cites work: Mapping the genome
cites work: Incidence matrices, interval graphs and seriation in archeology
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Profile minimization problem for matrices and graphs
cites work: Q5710169
cites work: Q3396557
cites work: \(E_{11}\) and M theory
DOI: 10.1007/S00453-007-9144-0
description: scientific article; zbMATH DE number 5377138