1154 search results - page 212 / 231 » On the editing distance of graphs |
PAM
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
ICNP
2003
IEEE
14 years 25 days ago
2003
IEEE
Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoc wireless networks, require replication of content, functionalit...
LATIN
2010
Springer
14 years 20 days ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
CDC
2009
IEEE
14 years 8 days ago
2009
IEEE
Abstract— We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the...
COCOON
2001
Springer
14 years 1 days ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...