1664 search results - page 124 / 333 » Distance labeling in graphs |
177
Voted
WAW
2004
Springer
16 years 6 days ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
179
click to vote
DM
2008
15 years 7 months ago
2008
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
152
click to vote
ISNN
2005
Springer
16 years 11 days ago
2005
Springer
The Self-Organizing Map is a popular neural network model for data analysis, for which a wide variety of visualization techniques exists. We present a novel technique that takes th...
167
click to vote
GD
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. One of the most popular graph drawing methods is based on achieving graph-theoretic target distances. This method was used by Kamada and Kawai [15], who formulated it as ...
171
click to vote
COR
2007
15 years 6 months ago
2007
The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...