176 search results - page 5 / 36 » A Problem Kernelization for Graph Packing |
AAIM
2010
Springer
13 years 12 months ago
2010
Springer
Abstract. We present new kernelization results for the s-cycle transversal problem for s > 3. In particular, we show a 6k2 kernel for 4-cycle transversal and a O(ks−1 ) kernel...
PAKDD
2007
ACM
14 years 1 months ago
2007
ACM
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
ICDM
2005
IEEE
14 years 1 months ago
2005
IEEE
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...