3757 search results - page 213 / 752 » The overlap number of a graph |
160
click to vote
DAM
2000
15 years 6 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
231
click to vote
TKDE
2012
13 years 9 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
167
click to vote
LAWEB
2006
IEEE
16 years 16 days ago
2006
IEEE
In this paper we study duplicates on the Web, using collections containing documents of all sites under the .cl domain that represent accurate and representative subsets of the We...
154
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
180
click to vote
RTSS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Multi-channel design has received significant attention for low-power wireless networks (LWNs), such as 802.15.4-based wireless sensor networks, due to its potential of...