6598 search results - page 116 / 1320 » Graph Theory with Applications |
135
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
138
click to vote
APN
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. High-Level net models following the paradigm “nets as tokens” have been studied already in the literature with several interesting applications. In this paper we prop...
178
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
183
click to vote
GG
2008
Springer
15 years 5 months ago
2008
Springer
Behavior preservation, namely the fact that the behavior of a model is not altered by the transformations, is a crucial property in refactoring. The most common approaches to behav...
120
click to vote
TIT
2008
15 years 4 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...