4171 search results - page 441 / 835 » Choice numbers of graphs |
159
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
172
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Body sensor networks are emerging as a promising platform for healthcare monitoring. These systems are composed of battery-operated embedded devices which process physiological ...
158
click to vote
ACCV
2009
Springer
16 years 1 months ago
2009
Springer
This paper addresses the problem of segmenting a textured mesh into objects or object classes, consistently with user-supplied seeds. We view this task as transductive learning and...
205
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
184
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...