242 search results - page 10 / 49 » Object-level Vertical Search |
SIAMDM
2008
13 years 7 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
SIGIR
2012
ACM
11 years 10 months ago
2012
ACM
Many of the recent, and more effective, retrieval models have incorporated dependencies between the terms in the query. In this paper, we advance this query representation one st...
ISR
2010
13 years 6 months ago
2010
We study how electronic markets that facilitate broader inter-firm transactions affect the vertical scope of emerging IT-enabled extended enterprises. We do so by modeling firms...
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...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...