Self-configuring virtual networks rely on structured P2P routing to provide seamless connectivity among nodes through overlay routing of virtual IP packets, support decentralized...
Arijit Ganguly, P. Oscar Boykin, David Wolinsky, R...
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
Michael R. Fellows, Guillaume Fertin, Danny Hermel...
Synchronization performance is a major problem with intermittently connected mobile databases. A server periodically generates update files for each client, which are downloaded ...