3471 search results - page 171 / 695 » Obstacle Numbers of Graphs |
177
click to vote
PROPERTYTESTING
2010
15 years 2 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
150
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain nu...
153
Voted
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
168
click to vote
KAIS
2011
14 years 11 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
115
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
In this work we address the general bin-picking problem where 3D data is available. We apply Harmonic Shape Contexts (HSC) features since these are invariant to translation, scale...