2356 search results - page 6 / 472 » Characterizations of postman sets |
DM
1999
13 years 9 months ago
1999
A defining set (of vertex coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We de...
CHI
2011
ACM
13 years 1 months ago
2011
ACM
People routinely rely on Internet search engines to support their use of interactive systems: they issue queries to learn how to accomplish tasks, troubleshoot problems, and other...
ICCV
2011
IEEE
12 years 9 months ago
2011
IEEE
Despite decades of study, robust shadow detection remains difficult, especially within a single color image. We describe a new approach to detect shadow boundaries in images of o...
TCS
1998
13 years 9 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...
BMCBI
2004
13 years 9 months ago
2004
Background: A central challenge in the molecular diagnosis and treatment of cancer is to define a set of molecular features that, taken together, distinguish a given cancer, or ty...