78 search results - page 4 / 16 » Linear Solvability in the Viewing Graph |
130
click to vote
PODS
2011
ACM
14 years 2 months ago
2011
ACM
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
ICTAC
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. P systems (known also as membrane systems) are biologically motivated theoretical models of distributed and parallel computing. The two most interesting questions in the ...
IPCO
2007
15 years 1 months ago
2007
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
MST
2007
14 years 11 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...