9532 search results - page 385 / 1907 » Logic, Graphs, and Algorithms |
172
Voted
APPROX
2004
Springer
16 years 5 days ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
145
click to vote
SWAT
2004
Springer
16 years 4 days ago
2004
Springer
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
155
click to vote
KDD
2009
ACM
15 years 11 months ago
2009
ACM
Learning temporal graph structures from time series data reveals important dependency relationships between current observations and histories. Most previous work focuses on learn...
179
click to vote
ICPP
1999
IEEE
15 years 11 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
170
click to vote
AVI
2006
15 years 8 months ago
2006
Graphs provide good representations for many domains. Interactive graph-based interfaces are desireable to browse and edit data for these domains. However, as graphs increase in s...