3267 search results - page 118 / 654 » Generalized quasirandom graphs |
APPROX
2004
Springer
15 years 4 months 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...
SWAT
2004
Springer
15 years 4 months 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...
102
click to vote
CHI
2010
ACM
15 years 4 months ago
2010
ACM
We present a tangible user interface (TUI) called Tangible Graph Builder, that has been designed to allow visually impaired users to access graph and chart-based data. We describe...
KDD
2009
ACM
15 years 3 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...
AIPS
2008
15 years 1 months ago
2008
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...