1664 search results - page 119 / 333 » Distance labeling in graphs |
128
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
Network routing may be required, under certain applications, to avoid certain areas (or nodes) These areas can be of potential security threat, possess poor quality or have other ...
114
click to vote
DCOSS
2006
Springer
15 years 8 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...
148
click to vote
ISMB
2003
15 years 5 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 ...
122
click to vote
TCS
2008
15 years 4 months ago
2008
This paper presents strategies for improving the known upper and lower bounds for the bandwidth of Hamming graphs (Kn)d and [0, 1]d. Our labeling strategy lowers the upper bound o...
159
click to vote
FCT
2009
Springer
15 years 8 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...