61 search results - page 9 / 13 » Parameterized Complexity of Even Odd Subgraph Problems |
225
click to vote
DISOPT
2011
14 years 10 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
121
click to vote
FOCS
2005
IEEE
15 years 8 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
129
click to vote
MOBIHOC
2006
ACM
16 years 2 months ago
2006
ACM
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
114
click to vote
STACS
2007
Springer
15 years 9 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
107
click to vote
GPCE
2008
Springer
15 years 4 months ago
2008
Springer
Extensive research efforts have been devoted to implement a group of type-safe mutually recursive classes; recently, proposals for separating each member of the group as a reusabl...