Polynomial kernels for Proper Interval Completion and related problems

Given a graph G=(V,E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V×V)∖E such that the graph H=(V,E∪F) is a proper interval graph. The Proper Interval Completion problem finds applications in molecular biology and genomic...

Full description

Bibliographic Details

Published in:	Information and computation Vol. 231; pp. 89 - 108
Main Authors:	Bessy, Stéphane, Perez, Anthony
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.10.2013 Elsevier
Subjects:	Computer Science Data Structures and Algorithms Graph modification problems Kernelization algorithms Parameterized complexity Proper interval graphs Graph modification problems Proper interval graphs Kernelization algorithms Parameterized complexity
ISSN:	0890-5401, 1090-2651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!