3471 search results - page 400 / 695 » Obstacle Numbers of Graphs |
156
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
158
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...
166
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 ...
156
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...
201
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...