1664 search results - page 111 / 333 » Distance labeling in graphs |
133
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
131
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
120
click to vote
DEXA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we propose the Graphical sEmistructured teMporal data model (GEM), which is based on labeled graphs and allows one to represent in a uniform way semistructu...
143
click to vote
SENSYS
2003
ACM
15 years 9 months ago
2003
ACM
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
104
click to vote
DM
2010
15 years 4 months ago
2010
An edge-magic total labelling (EMTL) of a graph G with n vertices and e edges is an injection : V (G)E(G) [n+e], where, for every edge uv E(G), we have wt(uv) = k, the magic sum...