215 search results - page 19 / 43 » On extremal k-outconnected graphs |
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
VRST
1997
ACM
13 years 11 months ago
1997
ACM
Abstract. We present an approach for modeling and realtime rendering of outdoor scenes, for use in virtual reality applications such as flight simulators and multi-user virtual env...
AAAI
1994
13 years 8 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
GC
2008
Springer
13 years 7 months ago
2008
Springer
A spanning subgraph H of a graph G is a 2-detour subgraph of G if for each x, y V (G), dH (x, y) dG(x, y) + 2. We prove a conjecture of Erdos, Hamburger, Pippert, and Weakley by ...