829 search results - page 88 / 166 » Distance domination-critical graphs |
101
click to vote
MOBIHOC
2005
ACM
15 years 11 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
DCOSS
2006
Springer
15 years 3 months ago
2006
Springer
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms o...
107
click to vote
ISMB
2003
15 years 1 months ago
2003
Comparative analysis of metabolic pathways in different genomes can give insights into the understanding of evolutionary and organizational relationships among species. This type ...
108
click to vote
FCT
2009
Springer
15 years 3 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
ARSCOM
2008
15 years 19 hour ago
2008
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...