1664 search results - page 113 / 333 » Distance labeling in graphs |
116
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...
153
click to vote
AIPS
2008
15 years 6 months ago
2008
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
127
click to vote
NIPS
2004
15 years 5 months ago
2004
We provide a method for mass meta-analysis in a neuroinformatics database containing stereotaxic Talairach coordinates from neuroimaging experiments. Database labels are used to g...
118
click to vote
ACL
2012
13 years 6 months ago
2012
We propose a new approach to characterizing the timeline of a text: temporal dependency structures, where all the events of a narrative are linked via partial ordering relations l...
126
click to vote
JDA
2007
15 years 4 months ago
2007
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...