316 search results - page 52 / 64 » The chromatic covering number of a graph |
ICDE
2005
IEEE
14 years 8 months ago
2005
IEEE
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
CONSTRAINTS
2007
13 years 7 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
JGAA
2000
13 years 7 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
COCOON
2003
Springer
14 years 18 days ago
2003
Springer
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
EMNLP
2010
13 years 5 months ago
2010
In state-of-the-art approaches to information extraction (IE), dependency graphs constitute the fundamental data structure for syntactic structuring and subsequent knowledge elici...