2294 search results - page 211 / 459 » From Path Graphs to Directed Path Graphs |
119
click to vote
WWW
2004
ACM
16 years 3 months ago
2004
ACM
This paper describes one solution to the problem of how to select sequence, and link Web resources into a coherent, focused organization for instruction that addresses a user'...
122
click to vote
TON
2008
15 years 2 months ago
2008
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
106
click to vote
ICSE
2004
IEEE-ACM
16 years 3 months ago
2004
IEEE-ACM
Abstract. Building systems from existing applications written in two or more languages is common practice. Such systems are polylingual. Polylingual systems are relatively easy to ...
115
Voted
APPROX
2004
Springer
15 years 8 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
104
Voted
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...