561 search results - page 80 / 113 » Shortest-Path Kernels on Graphs |
138
click to vote
FAW
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
128
click to vote
NIPS
2008
15 years 2 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
114
click to vote
CIDM
2009
IEEE
15 years 5 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...
129
click to vote
STACS
2007
Springer
15 years 7 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...
125
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...