1154 search results - page 46 / 231 » On the editing distance of graphs |
TON
2008
13 years 8 months ago
2008
Estimating distances in the Internet has been studied in the recent years due to its ability to improve the performance of many applications, e.g., in the peer-topeer realm. One sc...
GMP
2006
IEEE
14 years 2 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 ...
SWAT
1994
Springer
14 years 24 days 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
13 years 8 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
GIS
2006
ACM
14 years 9 months 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...