3268 search results - page 284 / 654 » The hub number of a graph |
228
click to vote
MST
2011
15 years 1 months ago
2011
Chang and Lyuu [Chang and Lyuu, 2008] study the spreading of a message in an Erd˝os-R´enyi random graph G(n, p) starting from a set of vertices that are convinced of the message...
183
click to vote
IWDC
2005
Springer
16 years 6 days ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
143
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...
202
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...
272
Voted
CP
2009
Springer
16 years 7 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...