Sciweavers

6 search results - page 2 / 2
» Vertex Cover Problem Parameterized Above and Below Tight Bou...
Sort
View
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
13 years 5 months ago
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 supe...
Gregory Gutin, Stefan Szeider, Anders Yeo