1933 search results - page 47 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
EVOW
2006
Springer
14 years 12 days ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
CIKM
2000
Springer
14 years 1 months ago
2000
Springer
We consider the problem of browsing the top ranked portion of the documents returned by an information retrieval system. We describe an interactive relevance feedback agent that a...
WAW
2007
Springer
14 years 2 months ago
2007
Springer
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
KELSI
2004
Springer
14 years 2 months ago
2004
Springer
There is an overwhelming increase in submissions to genomic databases, posing a problem for database maintenance, especially regarding annotation of fields left blank during submi...
ICDT
2005
ACM
14 years 2 months ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...