482 search results - page 48 / 97 » A Linear-Time Graph Kernel |
BPM
2010
Springer
14 years 11 months ago
2010
Springer
We propose a new semantics for the inclusive converging gateway (also known as Or-join). The new semantics coincides with the intuitive, widely agreed semantics for Or-joins on sou...
ESA
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
CIDM
2009
IEEE
15 years 1 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
103
click to vote
STACS
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
DATE
2006
IEEE
15 years 3 months ago
2006
IEEE
Pseudorandom test techniques are widely used for measuring the impulse response (IR) for linear devices and Volterra kernels for nonlinear devices, especially in the acoustics dom...