1664 search results - page 176 / 333 » Distance labeling in graphs |
219
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper, we consider a multi-agent system consisting of mobile agents with second-order dynamics. The communication network is determined by a standard interaction rule based...
178
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
170
click to vote
EJC
2008
15 years 6 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
177
click to vote
JAL
2006
15 years 6 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
154
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...