41 search results - page 9 / 9 » Conditional hardness for satisfiable 3-CSPs |
CIKM
2004
Springer
13 years 11 months ago
2004
Springer
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...