1664 search results - page 154 / 333 » Distance labeling in graphs |
155
click to vote
SODA
1998
ACM
15 years 6 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
119
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
128
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at m...
113
click to vote
ACL
2009
15 years 2 months ago
2009
Past work on English coordination has focused on coordination scope disambiguation. In Japanese, detecting whether coordination exists in a sentence is also a problem, and the sta...
160
click to vote
ER
1993
Springer
15 years 8 months ago
1993
Springer
Two major problems in schema integration are to identify correspondences between different conceptual schemas and to verify that the proposed correspondences are consistent with th...