Fixed-Parameter Complexity of Minimum Profile Problems

The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supergraph. Since computing the profile of a graph is an NP-hard problem, we consider parameterized versions of the problem....

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 52; no. 2; pp. 133 - 152
Main Authors:	Gutin, Gregory, Szeider, Stefan, Yeo, Anders
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.10.2008
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Graph profile Above guaranteed value Kernel Fixed parameter tractability
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!