1664 search results - page 192 / 333 » Distance labeling in graphs |
164
click to vote
FOCS
2008
IEEE
16 years 29 days ago
2008
IEEE
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
160
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...
216
click to vote
VISSOFT
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper a new approach for a metrics based software visualization is presented which supports an efficient and effective quality assessment of large object-oriented software...
173
click to vote
DIALM
1999
ACM
15 years 10 months ago
1999
ACM
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
136
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...