829 search results - page 67 / 166 » Distance domination-critical graphs |
176
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...
176
click to vote
ICDAR
2011
IEEE
14 years 5 months ago
2011
IEEE
—We propose a novel method to evaluate table segmentation results based on a table image ground truther. In the ground-truthing process, we first extract connected components fr...
133
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract--In the majority of studies on CSMA wireless networks, a contention graph is used to model the carrier sensing relationships among links. This is a 0-1 model in which two ...
230
click to vote
TKDE
2011
15 years 1 months ago
2011
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
158
click to vote
ALGORITHMICA
2007
15 years 6 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...