1664 search results - page 207 / 333 » Distance labeling in graphs |
166
click to vote
ICDE
2010
IEEE
16 years 2 months ago
2010
IEEE
— Many applications offer a form-based environment for na¨ıve users for accessing databases without being familiar with the database schema or a structured query language. User...
162
click to vote
INFOCOM
2009
IEEE
16 years 8 days ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
158
click to vote
RSA
2010
15 years 4 months ago
2010
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...
194
click to vote
SAC
2011
ACM
14 years 8 months ago
2011
ACM
We propose a novel approach and tool for collaborative software engineering and development. In model-based software engineering, the underlying data structure is a complex, direc...
139
click to vote
VLDB
1999
ACM
15 years 10 months ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...