39 search results - page 5 / 8 » Linear Kernel for Planar Connected Dominating Set |
IWPEC
2010
Springer
13 years 5 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
CAGD
2005
13 years 7 months ago
2005
Abstract: Barycentric coordinates can be used both to express a point inside a tetrahedron as a convex combination of the four vertices and to linearly interpolate data given at th...
NETWORKS
2010
13 years 6 months ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
NIPS
2007
13 years 9 months ago
2007
We present a theoretical study on the discriminative clustering framework, recently proposed for simultaneous subspace selection via linear discriminant analysis (LDA) and cluster...
BMCBI
2008
13 years 7 months ago
2008
Background: Growing interest on biological pathways has called for new statistical methods for modeling and testing a genetic pathway effect on a health outcome. The fact that gen...