1154 search results - page 44 / 231 » On the editing distance of graphs |
WSDM
2010
ACM
14 years 6 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
ICALP
2011
Springer
13 years 5 days ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
JAL
2006
13 years 8 months ago
2006
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined effic...
JCO
2007
13 years 8 months ago
2007
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
DMGT
2011
13 years 7 days ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...