811 search results - page 33 / 163 » An efficient algorithm for the configuration problem of domi... |
WALCOM
2008
IEEE
13 years 9 months ago
2008
IEEE
Abstract. Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (...
DATE
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
MASS
2010
13 years 2 months ago
2010
Abstract--Recent years have witnessed the emergence of numerous new Internet services for mobile users. Supporting mobile applications via public WiFi networks has received signifi...
CPM
2006
Springer
13 years 11 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph clas...