332 search results - page 34 / 67 » Complexity analysis of a decentralised graph colouring algor... |
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
TALG
2008
13 years 7 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
SRDS
1993
IEEE
13 years 11 months ago
1993
IEEE
We propose a simple and practical probabilistic comparison-based model, employing multiple incomplete test concepts, for handling fault location in distributed systems using a Bay...