3471 search results - page 248 / 695 » Obstacle Numbers of Graphs |
177
click to vote
FOCS
2009
IEEE
16 years 28 days ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
196
click to vote
AI
1998
Springer
15 years 5 months ago
1998
Springer
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...
174
click to vote
CIKM
2009
Springer
16 years 22 days ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
161
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
172
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...