2294 search results - page 220 / 459 » From Path Graphs to Directed Path Graphs |
117
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
138
click to vote
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
139
click to vote
KI
2005
Springer
15 years 8 months ago
2005
Springer
To reason about geographical objects, it is not only necessary to have more or less complete information about where these objects are located in space, but also how they can chang...
119
click to vote
SODA
1990
ACM
15 years 4 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
119
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...