1664 search results - page 53 / 333 » Distance labeling in graphs |
IJON
2010
14 years 10 months ago
2010
Due to the tremendous increase of electronic information with respect to the size of data sets as well as their dimension, dimension reduction and visualization of high-dimensiona...
GMP
2006
IEEE
15 years 6 months ago
2006
IEEE
The construction of linear mesh layouts has found various applications, such as implicit mesh filtering and mesh streaming, where a variety of layout quality criteria, e.g., span ...
121
click to vote
SWAT
1994
Springer
15 years 3 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
172
click to vote
GIS
2006
ACM
16 years 27 days ago
2006
ACM
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...