3471 search results - page 195 / 695 » Obstacle Numbers of Graphs |
137
Voted
DAM
2000
15 years 4 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;:::...
175
click to vote
TKDE
2012
13 years 7 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...
138
click to vote
LAWEB
2006
IEEE
15 years 11 months 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...
131
click to vote
APPROX
2006
Springer
15 years 8 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...
112
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— We propose belief propagation (BP) based detection algorithms for the Bell labs layered space-time (BLAST) architectures. We first develop a full complexity BP algorit...