225 search results - page 10 / 45 » From polynomial time queries to graph structure theory |
COLT
1993
Springer
15 years 1 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
CIKM
2004
Springer
15 years 3 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 ...
66
Voted
JAL
2002
14 years 9 months ago
2002
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
103
click to vote
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...