6 search results - page 1 / 2 » Fixed-Parameter Complexity of Minimum Profile Problems |
ALGORITHMICA
2008
13 years 4 months ago
2008
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...
IJCGA
2008
13 years 4 months ago
2008
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
ESA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
Selecting the most relevant factors from genetic profiles that can optimally characterize cellular states is of crucial importance in identifying complex disease genes and biomark...
IJRR
2008
13 years 4 months ago
2008
This paper deals with minimum time trajectory optimization along a specified path subject to thermal constraints. We point out here that robots are often integrated in complex rob...