803 search results - page 120 / 161 » Independence in Direct-Product Graphs |
SMI
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents a method to extract skeletons using examples. Our method is based on the observation that many deformations in real world applications are isometric or near is...
ECOWS
2007
Springer
14 years 2 months ago
2007
Springer
Dynamic composition of web services is a promising approach and at the same time a challenging research area for the dissemination of serviceoriented applications. It is widely rec...
WG
2007
Springer
14 years 2 months ago
2007
Springer
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
SPAA
2005
ACM
14 years 2 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 ...
MSWIM
2004
ACM
14 years 1 months ago
2004
ACM
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...