Interval Completion Is Fixed Parameter Tractable
type: Item
instance of: scholarly article
title: Interval Completion Is Fixed Parameter Tractable
zbMATH Open document ID: 1227.05241
DOI: 10.1137/070710913
author: Yngve Villanger
author: Pinar Heggernes
author: Christophe Paul
author: Jan Arne Telle
published in: SIAM Journal on Computing
publication date: 2009-11-06T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5626420
zbMATH Keywords: interval graphs
zbMATH Keywords: profile minimization
zbMATH Keywords: edge completion
zbMATH Keywords: FPT algorithm
zbMATH Keywords: branching
MaRDI profile type: Publication
Wikidata QID: Q56267431
full work available at URL: https://doi.org/10.1137/070710913
OpenAlex ID: W2086331454
DBLP publication ID: journals/siamcomp/VillangerHPT09
Recommended article: A Subexponential Parameterized Algorithm for Proper Interval Completion
Recommended article: Q4027320
Recommended article: Subexponential parameterized algorithm for Interval Completion
Recommended article: Fixed-Parameter Tractability and Completeness I: Basic Results
Recommended article: Subexponential Parameterized Algorithm for I <scp>nterval</scp> C <scp>ompletion</scp>
Recommended article: Interval Deletion is Fixed-Parameter Tractable
Recommended article: Interval Deletion Is Fixed-Parameter Tractable
Recommended article: Q4232802
Recommended article: Q5217434
description: scientific article